The analysis of a nested dissection algorithm

1986/07/01 by John R. Gilbert, Robert E. Tarjan, Robert Endre Tarjan · 80 citations
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Algorithm #Chordal graph #Combinatorics #Discrete mathematics #Graph #Graph Labeling and Dimension Problems #Interconnection Networks and Systems #Mathematics #Planar graph

paper · doi:10.1007/bf01396660

published in Numerische Mathematik 50(4), 377-404 (Springer Science and Business Media LLC)

crossref issued 1986/07/01 · crossref published 1986/07/01 · crossref published-print 1986/07/01 · openalex publication_date 1986/07/01 · crossref created 2005/04/02 · crossref deposited 2020/04/06 · openalex created_date 2025/10/10 · crossref indexed 2026/08/04 · openalex updated_date 2026/08/04

Citations

• Area-efficient graph layouts
• Decomposition of Finite Graphs Into Forests
• A Separator Theorem for Planar Graphs
• Algorithmic Aspects of Vertex Elimination on Graphs
• Nested Dissection of a Regular Finite Element Mesh

Cited by

• A DETERMINISTIC LINEAR TIME ALGORITHM FOR GEOMETRIC SEPARATORS AND ITS APPLICATIONS
• Convex drawings of graphs in two and three dimensions (preliminary version)
• Planar separator theorem [wikipedia]