Helly Circular-Arc Graph Isomorphism Is in Logspace

DOI10.1007/978-3-642-40313-2_56zbMath1388.68126OpenAlexW158639469MaRDI QIDQ2849949

Sebastian Kuhnert, Oleg Verbitsky, Johannes Köbler

Publication date: 20 September 2013

Published in: Mathematical Foundations of Computer Science 2013 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

Interval graph representation with given interval and intersection lengths ⋮ Canonical representations for circular-arc graphs using flip sets ⋮ On the isomorphism problem for Helly circular-arc graphs

This page was built for publication: Helly Circular-Arc Graph Isomorphism Is in Logspace