Sciweavers

47 search results - page 2 / 10
» A Lower Bound for Testing 3-Colorability in Bounded-Degree G...
Sort
View
ECCC
2007
91views more  ECCC 2007»
13 years 5 months ago
Testing Expansion in Bounded Degree Graphs
Satyen Kale, C. Seshadhri
RANDOM
2001
Springer
13 years 10 months ago
Near-optimum Universal Graphs for Graphs with Bounded Degrees
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakaw...
SIAMCOMP
2011
12 years 8 months ago
An Expansion Tester for Bounded Degree Graphs
We consider the problem of testing graph expansion (either vertex or edge) in the bounded degree model [10]. We give a property tester that given a graph with degree bound d, an ex...
Satyen Kale, C. Seshadhri
STOC
2007
ACM
239views Algorithms» more  STOC 2007»
14 years 5 months ago
Approximating minimum bounded degree spanning trees to within one of optimal
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
Mohit Singh, Lap Chi Lau