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

Das, BireswarBireswarDasEnduri, Murali KrishnaMurali KrishnaEnduriVinod Reddy, I.I.Vinod Reddy2025-08-302025-08-302015-01-01[9783319156118]10.1007/978-3-319-15612-5_302-s2.0-84923673320https://repository.iitgn.ac.in/handle/IITG2025/21508We 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.falseLogspace and FPT algorithms for graph isomorphism for subclasses of bounded tree-width graphsBook Chapter16113349329-334201562