Interval Graph Representation with Given Interval and Intersection Lengths

DOI10.1007/978-3-642-35261-4_54zbMath1260.05103OpenAlexW2199438582MaRDI QIDQ4909568

Sebastian Kuhnert, Osamu Watanabe, Johannes Köbler

Publication date: 21 March 2013

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

Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_54

zbMATH Keywords

linear time algorithminteval representations of graphslogspace algorithm

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Extending partial representations of interval graphs

This page was built for publication: Interval Graph Representation with Given Interval and Intersection Lengths