47 search results - page 3 / 10 » A Lower Bound for Testing 3-Colorability in Bounded-Degree G... |
156
click to vote
FOCS
2006
IEEE
16 years 1 days ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
155
click to vote
STACS
2010
Springer
16 years 29 days ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
167
click to vote
ECCC
2008
15 years 6 months ago
2008
Testing a property P of graphs in the bounded degree model is the following computational problem: given a graph G of bounded degree d we should distinguish (with probability 0.9,...
183
click to vote
COMGEO
2007
ACM
15 years 6 months ago
2007
ACM
The slope-number of a graph G is the minimum number of distinct edge slopes in a straight-line drawing of G in the plane. We prove that for Δ 5 and all large n, there is a Δ-reg...
159
click to vote
FOCS
2009
IEEE
16 years 22 days ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...