Article
Feedback vertex set on ATfree graphs
Laboratoire d’Informatique Théorique et Appliquée, Université de Metz, 57045 Metz Cedex 01, France; School of Computing, University of Leeds, Leeds LS2 9JT, UK; Laboratoire d’Informatique Fondamentale d’Orléans (LIFO), Université d’Orléans, BP 6759, 45067 Orléans Cedex 2, France
Discrete Applied Mathematics (Impact Factor: 0.68). 05/2008; DOI: 10.1016/j.dam.2007.10.006 Source: DBLP

Conference Paper: An exact algorithm for subset feedback vertex set on chordal graphs
[Show abstract] [Hide abstract]
ABSTRACT: Given a graph G=(V,E) and a set S⊆V, a set U⊆V is a subset feedback vertex set of (G,S) if no cycle in G[V∖U] contains a vertex of S. The Subset Feedback Vertex Set problem takes as input G, S, and an integer k, and the question is whether (G,S) has a subset feedback vertex set of cardinality or weight at most k. Both the weighted and the unweighted versions of this problem are NPcomplete on chordal graphs, even on their subclass split graphs. We give an algorithm with running time O(1.6708n) that enumerates all minimal subset feedback vertex sets on chordal graphs with n vertices. As a consequence, Subset Feedback Vertex Set can be solved in time O(1.6708n) on chordal graphs, both in the weighted and in the unweighted case. On arbitrary graphs, the fastest known algorithm for the problems has O(1.8638n) running time.Proceedings of the 7th international conference on Parameterized and Exact Computation; 09/2012 
Conference Paper: Colouring ATFree graphs
[Show abstract] [Hide abstract]
ABSTRACT: A vertex colouring assigns to each vertex of a graph a colour such that adjacent vertices have different colours. The algorithmic complexity of the Colouring problem, asking for the smallest number of colours needed to vertexcolour a given graph, is known for a large number of graph classes. Notably it is NPcomplete in general, but polynomial time solvable for perfect graphs. A triple of vertices of a graph is called an asteroidal triple if between any two of the vertices there is a path avoiding all neighbours of the third one. Asteroidal triplefree graphs form a graph class with a lot of interesting structural and algorithmic properties. Broersma et al. (ICALP 1997) asked to find out the algorithmic complexity of Colouring on ATfree graphs. Even the algorithmic complexity of the kColouring problem, which asks whether a graph can be coloured with at most a fixed number k of colours, remained unknown for ATfree graphs. First progress was made recently by Stacho who presented an O(n 4 ) time algorithm for 3colouring ATfree graphs (ISAAC 2010). In this paper we show that kColouring on ATfree graphs is in XP, i.e. polynomial time solvable for any fixed k. Even more, we present an algorithm using dynamic programming on an asteroidal decomposition which, for any fixed integers k and a, solves kColouring on any input graph G in time O(f(a,k)·n g(a,k) ), where a denotes the asteroidal number of G, and f(a,k) and g(a,k) are functions that do not depend on n. Hence for any fixed integer k, there is a polynomial time algorithm solving kColouring on graphs of bounded asteroidal number. The algorithm runs in time O(n 8k+2 ) on ATfree graphs.Proceedings of the 20th Annual European conference on Algorithms; 09/2012  [Show abstract] [Hide abstract]
ABSTRACT: This paper deals with the Feedback Vertex Set problem on undirected graphs, which asks for the existence of a vertex set of bounded size that intersects all cycles. Due it is theoretical and practical importance, the problem has been the subject of intensive study. Motivated by the parameter ecology program we attempt to classify the parameterized and kernelization complexity of Feedback Vertex Set for a wide range of parameters. We survey known results and present several new complexity classifications. For example, we prove that Feedback Vertex Set is fixedparameter tractable parameterized by the vertexdeletion distance to a chordal graph. We also prove that the problem admits a polynomial kernel when parameterized by the vertexdeletion distance to a pseudo forest, a graph in which every connected component has at most one cycle. In contrast, we prove that a slightly smaller parameterization does not allow for a polynomial kernel unless NP ⊆ coNP/poly and the polynomialtime hierarchy collapses.Tsinghua Science & Technology 08/2014; 19(4):387409.
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.