205 search results - page 2 / 41 » Engineering Planar Separator Algorithms |
SWAT
2000
Springer
15 years 29 days ago
2000
Springer
SIAMCOMP
2008
14 years 9 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. ...
102
click to vote
LATIN
1995
Springer
15 years 28 days ago
1995
Springer
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The appr...
FSTTCS
2008
Springer
14 years 10 months ago
2008
Springer
We consider the isomorphism and canonization problem for 3-connected planar graphs. The problem was known to be L -hard and in UL ∩ coUL [TW08]. In this paper, we give a determin...
FCT
1995
Springer
15 years 29 days ago
1995
Springer
Abstract. We present algorithms for maintaining shortest path information in dynamic outerplanar digraphs with sublogarithmic query time. By choosing appropriate parameters we achi...