646 search results - page 111 / 130 » Generalized connected domination in graphs |
109
Voted
JCT
1998
15 years 1 months ago
1998
The aim of this note is to point out some combinatorial applications of a lemma of Scarf, proved first in the context of game theory. The usefulness of the lemma in combinatorics...
122
click to vote
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
This paper presents a theoretical study of decentralized control for sensing-based shape formation on modular multirobot systems, where the desired shape is specified in terms of ...
135
Voted
FOCS
2008
IEEE
15 years 8 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
98
Voted
IMC
2004
ACM
15 years 7 months ago
2004
ACM
The Internet is teeming with high variability phenomena, from measured IP flow sizes to aspects of inferred router-level connectivity, but there still exists considerable debate ...
119
click to vote
SODA
1992
ACM
15 years 3 months ago
1992
ACM
Let P be a property of undirected graphs. We consider the following problem: given a graph G that has property P, nd a minimal spanning subgraph of G with property P. We describe ...