109 search results - page 11 / 22 » Edge-Disjoint Paths in Planar Graphs |
ICCV
2007
IEEE
14 years 1 months ago
2007
IEEE
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
GD
2004
Springer
14 years 26 days ago
2004
Springer
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) grid, with at most three bends per edge, where n is the number of verti...
FCT
2009
Springer
13 years 11 months ago
2009
Springer
We show that the reachability problem for directed graphs that are either K3,3-free or K5-free is in unambiguous log-space, UL coUL. This significantly extends the result of Bour...
ICNP
2005
IEEE
14 years 1 months ago
2005
IEEE
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...