109 search results - page 7 / 22 » Edge-Disjoint Paths in Planar Graphs |
MFCS
2007
Springer
15 years 3 months ago
2007
Springer
Suppose we are given a graph G together with two proper vertex k-colourings of G, α and β. How easily can we decide whether it is possible to transform α into β by recolouring...
SODA
2008
ACM
14 years 10 months ago
2008
ACM
JCSS
2006
14 years 9 months ago
2006
CORR
2010
Springer
14 years 6 months ago
2010
Springer
80
Voted
ISAAC
2005
Springer
15 years 2 months ago
2005
Springer
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...