205 search results - page 1 / 41 » Engineering Planar Separator Algorithms |
ESA
2005
Springer
13 years 10 months ago
2005
Springer
SIGAL
1990
13 years 8 months ago
1990
In this paper we show that every 2-connected embedded planar graph with faces of sizes
SIAMCOMP
1998
13 years 4 months ago
1998
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
SPAA
1993
ACM
13 years 8 months ago
1993
ACM
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
STOC
1990
ACM
13 years 8 months ago
1990
ACM
a 3-dimensions a separator size where is the ber of 3-simplexes in and is the number of ization of the separator results for planar graphs, such as the and Tarjan planar separator...