Computer Science – Computational Complexity
Scientific paper
2010-01-03
Computer Science
Computational Complexity
STACS conference 2010, 12 pages
Scientific paper
The Graph Isomorphism problem restricted to graphs of bounded treewidth or bounded tree distance width are known to be solvable in polynomial time [Bod90],[YBFT99]. We give restricted space algorithms for these problems proving the following results: - Isomorphism for bounded tree distance width graphs is in L and thus complete for the class. We also show that for this kind of graphs a canon can be computed within logspace. - For bounded treewidth graphs, when both input graphs are given together with a tree decomposition, the problem of whether there is an isomorphism which respects the decompositions (i.e. considering only isomorphisms mapping bags in one decomposition blockwise onto bags in the other decomposition) is in L. - For bounded treewidth graphs, when one of the input graphs is given with a tree decomposition the isomorphism problem is in LogCFL. - As a corollary the isomorphism problem for bounded treewidth graphs is in LogCFL. This improves the known TC1 upper bound for the problem given by Grohe and Verbitsky [GroVer06].
Das Bireswar
Toran Jacobo
Wagner Fabian
No associations
LandOfFree
Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-222912