Wheel-free deletion is W[2]-hard

Authors:
Daniel Lokshtanov
Affiliations:
Department of Informatics, University of Bergen, Bergen, Norway
Venue:
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Year:
2008

Citing 12
Cited 6

Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs

SIAM Journal on Computing
Chordal completions of planar graphs

Journal of Combinatorial Theory Series B
Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Fixed-parameter tractability of graph modification problems for hereditary properties

Information Processing Letters
Orienting graphs to optimize reachability

Information Processing Letters
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs

SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Parameterized complexity of finding subgraphs with hereditary properties

Theoretical Computer Science
Graph Minors. XX. Wagner's conjecture

Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Interval completion with few edges

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Finding odd cycle transversals

Operations Research Letters

Parameterizing above or below guaranteed values

Journal of Computer and System Sciences
Parameterized complexity of vertex deletion into perfect graph classes

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Compression via matroids: a randomized polynomial kernel for odd cycle transversal

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Parameterized complexity of eulerian deletion problems

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Finding small separators in linear time via treewidth reduction

ACM Transactions on Algorithms (TALG)
Parameterized complexity of vertex deletion into perfect graph classes

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that the two problems of deciding whether k verticesor k edges can be deleted from a graph to obtain a wheel-free graphis W[2]-hard. This immediately implies that deciding whether k edgescan be added to obtain a graph that contains no complement of a wheelas an induced subgraph is W[2]-hard, thereby resolving an open problemof Heggernes et al. [7] (STOC07) who ask whether there is a polynomialtime recognizable hereditary graph class Π with the property that computingthe minimum Π-completion is W[t]-hard for some t.