55 search results - page 10 / 11 » A Simple MAX-CUT Algorithm for Planar Graphs |
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...
FOCS
2008
IEEE
14 years 1 months ago
2008
IEEE
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both ...
SIROCCO
2001
13 years 8 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Schnyder woods are decompositions of simple triangulations into three edge-disjoint spanning trees crossing each other in a specific way. In this article, we define a generalizatio...