An ${\mathcal{O}}(n^2)$ -time Algorithm for the Minimal Interval Completion Problem

DOI10.1007/978-3-642-13562-0_17zbMath1284.05278OpenAlexW2498850858MaRDI QIDQ3569074

Ioan Todinca, Christophe Crespelle

Publication date: 17 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13562-0_17

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem ⋮ Approximating the path-distance-width for AT-free graphs and graphs in related classes ⋮ Linear-Time Recognition of Probe Interval Graphs

This page was built for publication: An ${\mathcal{O}}(n^2)$ -time Algorithm for the Minimal Interval Completion Problem