Pages that link to "Item:Q3344230"
From MaRDI portal
The following pages link to A Separator Theorem for Chordal Graphs (Q3344230):
Displaying 20 items.
- Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs (Q472490) (← links)
- Collective tree spanners in graphs with bounded parameters (Q848633) (← links)
- Anticoloring and separation of graphs (Q960942) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- The analysis of a nested dissection algorithm (Q1103322) (← links)
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs (Q1111390) (← links)
- Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)
- A partial k-arboretum of graphs with bounded treewidth (Q1274912) (← links)
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences (Q2253192) (← links)
- Additive sparse spanners for graphs with bounded length of largest induced cycle (Q2576868) (← links)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs (Q3088092) (← links)
- Étude de la séparation et de l'élimination sur une famille de graphes quotients déduite d'une méthode de dissections emboîtées (Q3789083) (← links)
- Approximation and Kernelization for Chordal Vertex Deletion (Q4586151) (← links)
- Bi-Covering: Covering Edges with Two Small Subsets of Vertices (Q4596825) (← links)
- Distributed Relationship Schemes for Trees (Q5387807) (← links)
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs (Q5458559) (← links)
- Space-efficient algorithms for reachability in directed geometric graphs (Q6039899) (← links)
- Space efficient algorithm for solving reachability using tree decomposition and separators (Q6199388) (← links)
