22 search results - page 3 / 5 » Properties of vertex cover obstructions |
173
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
146
click to vote
SRDS
2005
IEEE
15 years 11 months ago
2005
IEEE
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
205
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
149
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Possibly the most famous algorithmic meta-theorem is Courcelle's theorem, which states that all MSO-expressible graph properties are decidable in linear time for gra...
147
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...