Isomorphism for Graphs of Bounded Feedback Vertex Set Number

This paper presents an O(n2 ) algorithm for deciding isomorphism of graphs that have bounded feedback vertex set number. This number is defined as the minimum number of vertex deletions required to obtain a forest. Our result implies that Graph Isomorphism is fixedparameter tractable with respect to the feedback vertex set number. Central to the algorithm is a new technique consisting of an application of reduction rules that produce an isomorphisminvariant outcome, interleaved with the creation of increasingly large partial isomorphisms.

• Type: Conference
• Year: 2010
• Where: SWAT
• Authors: Stefan Kratsch, Pascal Schweitzer
• Keywords: Feedback Vertex Set, SWAT 2010, Vertex Deletions, Vertex Set Number