A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
We prove that the Graph Isomorphism problem is fixed-parameter tractable when parameterized by the feedback vertex set number. That parameter is defined as the number of vertex deletions required to obtain a forest. For graphs of bounded feedback vertex set number the presented algorithm runs in time O(n 2 ), and is thereby the first fixed-parameter tractable Graph Isomorphism algorithm for a non-trivial parameter. Central to the algorithm is a new technique consisting of an application ofdoi:10.1007/978-3-642-13731-0_9 fatcat:ys6cnyk3qfaatfczzh24vkxlvm