1633 search results - page 70 / 327 » Planar Map Graphs |
163
click to vote
SIBGRAPI
2005
IEEE
15 years 11 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...
133
click to vote
GD
2009
Springer
15 years 10 months 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...
146
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
162
click to vote
ISAAC
2005
Springer
15 years 11 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...
146
click to vote
ISAAC
2003
Springer
15 years 11 months 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...