Skip to main content
Conference Proceedings

Logspace and FPT algorithms for graph isomorphism for subclasses of bounded tree-width graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2015) 8973 329-334
DOI: 10.1007/978-3-319-15612-5_30
5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give a deterministic logspace algorithm for the graph isomorphism problem for graphs with bounded tree-depth. We also show that the graph isomorphism problem is fixed parameter tractable for a related parameterized graph class where the graph parameter is the length of the longest cycle.

Cite

CITATION STYLE

APA

Das, B., Enduri, M. K., & Vinod Reddy, I. (2015). Logspace and FPT algorithms for graph isomorphism for subclasses of bounded tree-width graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8973, pp. 329–334). Springer Verlag. https://doi.org/10.1007/978-3-319-15612-5_30

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