Characterizing Minimal Interval Completions
From MaRDI portal
Publication:3590937
DOI10.1007/978-3-540-70918-3_21zbMath1171.68620OpenAlexW1512056994MaRDI QIDQ3590937
Pinar Heggernes, Ioan Todinca, Karol Suchan, Yngve Villanger
Publication date: 3 September 2007
Published in: STACS 2007 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70918-3_21
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (10)
Pathwidth is NP-Hard for Weighted Trees ⋮ Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone ⋮ Characterizing and Computing Minimal Cograph Completions ⋮ Pathwidth of Circular-Arc Graphs ⋮ On Listing, Sampling, and Counting the Chordal Graphs with Edge Constraints ⋮ Strongly chordal and chordal bipartite graphs are sandwich monotone ⋮ Minimal split completions ⋮ Characterizing and computing minimal cograph completions ⋮ On listing, sampling, and counting the chordal graphs with edge constraints ⋮ Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
This page was built for publication: Characterizing Minimal Interval Completions
