Interval Graphs: Canonical Representation in Logspace

DOI10.1007/978-3-642-14165-2_33zbMath1288.05281OpenAlexW1540331880MaRDI QIDQ3587393

Bastian Laubner, Oleg Verbitsky, Sebastian Kuhnert, Johannes Köbler

Publication date: 7 September 2010

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-14165-2_33

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

The QAP-polytope and the graph isomorphism problem ⋮ Toll convexity

This page was built for publication: Interval Graphs: Canonical Representation in Logspace