Algorithms for graphs of bounded treewidth via orthogonal range searching

2009/02/22 by Sergio Cabello, Christian Knauer · 15 citations
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Bounded function #Chordal graph #Combinatorics #Computational Geometry and Mesh Generation #Data Management and Algorithms #Discrete mathematics #Graph #Line graph #Mathematical analysis #Mathematics #Outerplanar graph #Partial k-tree #Pathwidth #Treewidth

paper · pdf · doi:10.1016/j.comgeo.2009.02.001

published in Computational Geometry 42(9), 815-824 (Elsevier BV)

openalex publication_date 2009/02/22 · crossref created 2009/02/22 · crossref issued 2009/11/01 · crossref published 2009/11/01 · crossref published-print 2009/11/01 · crossref deposited 2019/05/18 · openalex created_date 2025/10/10 · crossref indexed 2026/05/01 · openalex updated_date 2026/07/31

Citations

• Efficient Algorithms for the Weighted 2-Center Problem in a Cactus Graph
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• A sweepline algorithm for Voronoi diagrams
• A partial k-arboretum of graphs with bounded treewidth
• How to compute the Wiener index of a graph
• Structural Determination of Paraffin Boiling Points

Cited by

• Wiener index [wikipedia]