Algorithms – ESA 2005

DOI10.1007/11561071zbMath1162.68494OpenAlexW2501059503MaRDI QIDQ5475850

Pinar Heggernes, Karol Suchan, Yngve Villanger, Ioan Todinca

Publication date: 27 June 2006

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

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (7)

On the effectiveness of the incremental approach to minimal chordal edge modification ⋮ An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem ⋮ Minimal proper interval completions ⋮ Minimal split completions ⋮ Minimal interval completion through graph exploration ⋮ Dynamically maintaining split graphs ⋮ Exact algorithms for intervalizing coloured graphs

This page was built for publication: Algorithms – ESA 2005