9532 search results - page 160 / 1907 » Logic, Graphs, and Algorithms |
136
click to vote
COCOON
2009
Springer
15 years 11 months ago
2009
Springer
A graph class is sandwich monotone if, for every pair of its graphs G1 = (V, E1) and G2 = (V, E2) with E1 ⊂ E2, there is an ordering e1, . . . , ek of the edges in E2 \ E1 such ...
129
click to vote
COMBINATORICA
2008
15 years 4 months ago
2008
It is a long standing open problem to find an explicit description of the stable set polytope of clawfree graphs. Yet more than 20 years after the discovery of a polynomial algori...
119
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxili...
144
Voted
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
233
click to vote
ICDE
2008
IEEE
16 years 5 months ago
2008
IEEE
Due to rapid growth of the Internet technology and new scientific/technological advances, the number of applications that model data as graphs increases, because graphs have high e...