A Separator Theorem for Chordal Graphs
From MaRDI portal
Recommendations
Cites work
- A separator theorem for graphs of bounded genus
- A Separator Theorem for Planar Graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Applications of a Planar Separator Theorem
- Area-efficient VLSI layouts for binary hypercubes
- Computing the Minimum Fill-In is NP-Complete
- Generalized Nested Dissection
- scientific article; zbMATH DE number 3152801 (Why is no real title available?)
- scientific article; zbMATH DE number 3420184 (Why is no real title available?)
- Incidence matrices and interval graphs
- On rigid circuit graphs
- On simple characterizations of k-trees
- On the Problem of Partitioning Planar Graphs
- Triangulated graphs and the elimination process
Cited in
(38)- The clique-separator graph for chordal graphs
- The analysis of a nested dissection algorithm
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
- Maximal chordal subgraphs
- Counting clique trees and computing perfect elimination schemes in parallel
- A partial k-arboretum of graphs with bounded treewidth
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
- Treewidth for graphs with small chordality
- The separator theorem for rooted directed vertex graphs
- Isomorphism of chordal (6, 3) graphs
- Collective additive tree spanners of bounded tree-breadth graphs with generalizations and consequences
- Additive sparse spanners for graphs with bounded length of largest induced cycle
- Separability of symmetric degree-four chordal ring networks
- A decomposition theorem for chordal graphs and its applications
- scientific article; zbMATH DE number 4134082 (Why is no real title available?)
- An Approximation Algorithm for the Tree t-Spanner Problem on Unweighted Graphs via Generalized Chordal Graphs
- Largest chordal and interval subgraphs faster than \(2^n\)
- scientific article; zbMATH DE number 4202291 (Why is no real title available?)
- Connected (s,t)-vertex separator parameterized by chordality
- Chord theorems on graphs
- Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- scientific article; zbMATH DE number 3910422 (Why is no real title available?)
- É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
- scientific article; zbMATH DE number 1990684 (Why is no real title available?)
- Approximation and kernelization for chordal vertex deletion
- Bi-covering: covering edges with two small subsets of vertices
- An approximation algorithm for the tree \(t\)-spanner problem on unweighted graphs via generalized chordal graphs
- Edge erasures and chordal graphs
- Separator theorems for interval graphs and proper interval graphs
- Distributed Relationship Schemes for Trees
- Independent separator graphs
- Collective Additive Tree Spanners of Homogeneously Orderable Graphs
- Space-efficient algorithms for reachability in directed geometric graphs
- Some results on connected vertex separators
- Space efficient algorithm for solving reachability using tree decomposition and separators
- Collective tree spanners in graphs with bounded parameters
- Anticoloring and separation of graphs
- Treewidth computations. I: Upper bounds
This page was built for publication: A Separator Theorem for Chordal Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3344230)
