Minimal Interval Completion Through Graph Exploration

DOI10.1007/11940128_52zbMath1135.68526OpenAlexW1487436919WikidataQ62046067 ScholiaQ62046067MaRDI QIDQ5459146

Ioan Todinca, Karol Suchan

Publication date: 24 April 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11940128_52

Mathematics Subject Classification ID

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 (4)

Characterizing and Computing Minimal Cograph Completions ⋮ Minimal comparability completions of arbitrary graphs ⋮ Characterizing and computing minimal cograph completions ⋮ Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions

This page was built for publication: Minimal Interval Completion Through Graph Exploration