3008 search results - page 352 / 602 » Independence in connected graphs |
191
click to vote
SODA
1997
ACM
15 years 8 months ago
1997
ACM
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
181
click to vote
IPCO
1993
15 years 8 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
194
Voted
SWAP
2007
15 years 8 months ago
2007
This paper proposes a novel framework for composing web databases. Web databases are assumed to have explicit descriptions of I/O attributes and are considered as components of fun...
177
Voted
AUTOMATICA
2010
15 years 7 months ago
2010
We propose a class of discrete-time dynamic average consensus algorithms that allow a group of agents to track the average of their reference inputs. The convergence results rely ...
182
click to vote
ENTCS
2008
15 years 6 months ago
2008
In this paper, we define labeled multigraphs with ports, a graph model which specifies connection points for nodes and allows multiple edges and loops. The dynamic evolution of th...