Sciweavers

15 search results - page 1 / 3
» A Minimum Feedback Vertex Set in the Trivalent Cayley Graph
Sort
View
DAGSTUHL
2006
13 years 6 months ago
Vertex reconstruction in Cayley graphs
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...
Elena V. Konstantinova
WADS
2007
Springer
114views Algorithms» more  WADS 2007»
13 years 11 months ago
Improved Algorithms for the Feedback Vertex Set Problems
Abstract. We present improved parameterized algorithms for the Feedback Vertex Set problem on both unweighted and weighted graphs. Both algorithms run in time O(5k kn2 ). The algor...
Jianer Chen, Fedor V. Fomin, Yang Liu 0002, Songji...
DAM
2008
108views more  DAM 2008»
13 years 5 months ago
Feedback vertex set on AT-free graphs
We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for ...
Dieter Kratsch, Haiko Müller, Ioan Todinca
SWAT
2010
Springer
260views Algorithms» more  SWAT 2010»
13 years 10 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 de...
Stefan Kratsch, Pascal Schweitzer