Abstract
We show that Graph Isomorphism problem (GI) can be solved in O(n 2) time for graphs of bounded connected-path-distancewidth, and more generally, in O(nc+1) time for graphs of bounded c-connected-path- distance-width, where n is the number of vertices. These results extend the result of Yamazaki, Bodlaender, de Fluiter, and Thilikos [Isomorphism for graphs of bounded distance width. Algorithmica 24, 105-127 (1999)], who showed the fixed-parameter tractability of GI parameterized by rooted-path-distance-width. © Springer-Verlag Berlin Heidelberg 2012.
Author supplied keywords
Cite
CITATION STYLE
Otachi, Y. (2012). Isomorphism for graphs of bounded connected-path-distance-width. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7676 LNCS, pp. 455–464). Springer Verlag. https://doi.org/10.1007/978-3-642-35261-4_48
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
