Skip to main content
Conference Proceedings

Interval graphs: Canonical representation in logspace

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6198 LNCS(PART 1) 384-395
DOI: 10.1007/978-3-642-14165-2_33
5Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a logspace algorithm for computing a canonical labeling, in fact a canonical interval representation, for interval graphs. As a consequence, the isomorphism and automorphism problems for interval graphs are solvable in logspace. © 2010 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Köbler, J., Kuhnert, S., Laubner, B., & Verbitsky, O. (2010). Interval graphs: Canonical representation in logspace. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6198 LNCS, pp. 384–395). https://doi.org/10.1007/978-3-642-14165-2_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free