Sciweavers

Share
SWAT
2010
Springer

Isomorphism for Graphs of Bounded Feedback Vertex Set Number

9 years 11 months ago
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.
Stefan Kratsch, Pascal Schweitzer
Added 11 Jul 2010
Updated 11 Jul 2010
Type Conference
Year 2010
Where SWAT
Authors Stefan Kratsch, Pascal Schweitzer
Comments (0)
books