376 search results - page 25 / 76 » Near-optimum Universal Graphs for Graphs with Bounded Degree... |
160
click to vote
FOCS
2008
IEEE
16 years 14 days ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...
191
click to vote
FOCS
2008
IEEE
16 years 14 days 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...
158
click to vote
JDA
2010
15 years 24 days ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
147
click to vote
RSA
2006
15 years 6 months ago
2006
In this paper, we prove that there exists a function k = (4 + o(1))k such that G(n, /n) contains a k-regular graph with high probability whenever > k. In the case of k = 3, it...
165
click to vote
WDAG
2000
Springer
15 years 9 months ago
2000
Springer
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...