376 search results - page 8 / 76 » Near-optimum Universal Graphs for Graphs with Bounded Degree... |
149
click to vote
PROPERTYTESTING
2010
14 years 11 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
105
click to vote
COCO
2009
Springer
15 years 8 months ago
2009
Springer
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
117
click to vote
DM
2008
15 years 1 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
