Separators in Two and Three Dimensions

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 We show that a family of separators this family of separators we get an time gorithm for solving linear systems that arise from parallel algorithm design. Divide-and-Conquer can give both fast and efficient algorithms. For graph algorithms and numerical analysis the efficiency of said the there a constant 6 < 1such that arator graphs the constructions work in RNC with a reasonably plasmall number of processors. nar graph has that They gave a linear time algorithm to find

• Type: Conference
• Year: 1990
• Where: STOC
• Authors: Gary L. Miller, William P. Thurston
• Keywords: Algorithms, Planar Graphs, Separator Size, STOC 1990, Tarjan Planar Separator