643 search results - page 32 / 129 » Supereulerian planar graphs |
SIBGRAPI
2005
IEEE
14 years 1 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
GD
2009
Springer
14 years 7 days ago
2009
Springer
Recently, we have presented a new practical method for upward crossing minimization [4], which clearly outperformed existing approaches for drawing hierarchical graphs in that resp...
ISAAC
2005
Springer
14 years 1 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...
FCT
2009
Springer
14 years 2 months ago
2009
Springer
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
ISAAC
2003
Springer
14 years 25 days ago
2003
Springer
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...