376 search results - page 39 / 76 » Near-optimum Universal Graphs for Graphs with Bounded Degree... |
147
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
110
click to vote
EJC
2008
15 years 2 months ago
2008
Abstract. We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new ...
104
click to vote
ESA
2006
Springer
15 years 5 months ago
2006
Springer
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
109
click to vote
CORR
2010
Springer
15 years 15 days ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
111
click to vote
JNW
2007
15 years 1 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...