Minimal Proper Interval Completions
From MaRDI portal
Publication:3522959
DOI10.1007/11917496_20zbMath1167.05326OpenAlexW1599973912MaRDI QIDQ3522959
Karol Suchan, Ioan Todinca, Ivan Rapaport
Publication date: 4 September 2008
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11917496_20
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (5)
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 ⋮ Minimal interval completion through graph exploration
This page was built for publication: Minimal Proper Interval Completions
