Strongly chordal and chordal bipartite graphs are sandwich monotone
From MaRDI portal
Publication:652637
DOI10.1007/s10878-010-9322-xzbMath1230.90161OpenAlexW1986338131MaRDI QIDQ652637
Pinar Heggernes, R. Sritharan, Charis Papadopoulos, Federico Mancini
Publication date: 15 December 2011
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9322-x
Related Items (max. 100)
Cites Work
- Safe separators for treewidth
- Minimal split completions
- On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
- Characterizations of strongly chordal graphs
- Algorithmic graph theory and perfect graphs
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
- Doubly lexical ordering of dense 0--1 matrices
- Chordal bipartite completion of colored graphs
- Triangulated graphs and the elimination process
- Treewidth and Minimum Fill-in: Grouping the Minimal Separators
- Characterizing and Computing Minimal Cograph Completions
- On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints
- Every monotone graph property is testable
- Characterizing Minimal Interval Completions
- Exact Algorithms for Treewidth and Minimum Fill-In
- Three Partition Refinement Algorithms
- Computing the Minimum Fill-In is NP-Complete
- Algorithmic Aspects of Vertex Elimination on Graphs
- Several results on chordal bipartite graphs
- Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs
- Complexity classification of some edge modification problems
- Measures on monotone properties of graphs
This page was built for publication: Strongly chordal and chordal bipartite graphs are sandwich monotone
