Finding odd cycle transversals

Authors:
Bruce Reed;Kaleigh Smith;Adrian Vetta
Affiliations:
School of Computer Science, McGill University, Room 301, McConnell Engineering Building, 3480 University, Montreal, Québec, Canada H3A 2A7;School of Computer Science, McGill University, Room 318, McConnell Engineering Building, 3480 University, Montreal, Québec, Canada H3A 2A7;Department of Mathematics and Statistics and School of Computer Science, McGill University, Room 1118, Burnside Building, 805 Sherbrooke, Montreal, Québec, Canada H3A 2K6
Venue:
Operations Research Letters
Year:
2004

Citing 2
Cited 84

Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Practical Algorithms and Fixed-Parameter Tractability for the Single Individual SNP Haplotyping Problem

WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics

The method of extremal structure on the k-maximum cut problem

CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
Parameterized coloring problems on chordal graphs

Theoretical Computer Science - Parameterized and exact computation
Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization

Journal of Computer and System Sciences
Planar graph bipartization in linear time

Discrete Applied Mathematics
A fixed-parameter algorithm for the directed feedback vertex set problem

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Efficient algorithms for counting parameterized list H-colorings

Journal of Computer and System Sciences
A fixed-parameter algorithm for the directed feedback vertex set problem

Journal of the ACM (JACM)
Improved algorithms for feedback vertex set problems

Journal of Computer and System Sciences
Parameterizing above or below guaranteed values

Journal of Computer and System Sciences
A nearly linear time algorithm for the half integral parity disjoint paths packing problem

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Parameterized complexity of finding regular induced subgraphs

Journal of Discrete Algorithms
Iterative Compression for Exactly Solving NP-Hard Minimization Problems

Algorithmics of Large and Complex Networks
Constant ratio fixed-parameter approximation of the edge multicut problem

Information Processing Letters
Almost 2-SAT is fixed-parameter tractable

Journal of Computer and System Sciences
Iterative compression and exact algorithms

Theoretical Computer Science
Minimum fill-in and treewidth of split+ke and split+kv graphs

Discrete Applied Mathematics
The complexity of finding subgraphs whose matching number equals the vertex cover number

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Randomized disposal of unknowns and implicitly enforced bounds on parameters

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
FPT algorithms for path-transversals and cycle-transversals problems in graphs

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Wheel-free deletion is W[2]-hard

IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Fixed-parameter algorithms for cluster vertex deletion

LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Odd cycle packing

Proceedings of the forty-second ACM symposium on Theory of computing
Separator-based data reduction for signed graph balancing

Journal of Combinatorial Optimization
An (almost) linear time algorithm for odd cycles transversal

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Parameterized algorithms

Algorithms and theory of computation handbook
Feedback vertex sets in tournaments

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Measuring indifference: unit interval vertex deletion

WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems

ACM Transactions on Computation Theory (TOCT)
Fixed-parameter tractability of multicut parameterized by the size of the cutset

Proceedings of the forty-third annual ACM symposium on Theory of computing
Subset feedback vertex set is fixed-parameter tractable

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems

Theoretical Computer Science
On the partition of 3-colorable graphs

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
On parameterized independent feedback vertex set

COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Feedback vertex set in mixed graphs

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Parameterized complexity of vertex deletion into perfect graph classes

FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
Paths, flowers and vertex cover

ESA'11 Proceedings of the 19th European conference on Algorithms
Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching

ACM Transactions on Algorithms (TALG)
Chordal deletion is fixed-parameter tractable

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Compression via matroids: a randomized polynomial kernel for odd cycle transversal

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Improved exact exponential algorithms for vertex bipartization and other problems

ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem*

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Sharp separation and applications to exact and parameterized algorithms

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Slightly superexponential parameterized problems

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Known algorithms on graphs of bounded treewidth are probably optimal

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The stubborn problem is stubborn no more: a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Fixed-parameter tractability results for feedback set problems in tournaments

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Improved fixed-parameter algorithms for two feedback set problems

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Algorithm engineering for optimal graph bipartization

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
On feedback vertex set new measure and new structures

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Fixed-Parameter algorithms for cochromatic number and disjoint rectangle stabbing

SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Towards a taxonomy of techniques for designing parameterized algorithms

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Fixed-parameter algorithm for general pedigrees with a single pair of sites

ISBRA'10 Proceedings of the 6th international conference on Bioinformatics Research and Applications
Important separators and parameterized algorithms

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
Generalized above guarantee vertex cover and r-partization

WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Note: A note on the parameterized complexity of unordered maximum tree orientation

Discrete Applied Mathematics
Augmenting tractable fragments of abstract argumentation

Artificial Intelligence
On polynomial kernels for structural parameterizations of odd cycle transversal

IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
A parameterized complexity tutorial

LATA'12 Proceedings of the 6th international conference on Language and Automata Theory and Applications
Augmenting tractable fragments of abstract argumentation

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
FPT algorithms for path-transversal and cycle-transversal problems

Discrete Optimization
Fixed-Parameter tractability of almost CSP problem with decisive relations

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
A basic parameterized complexity primer

The Multivariate Algorithmic Revolution and Beyond
Backdoors to satisfaction

The Multivariate Algorithmic Revolution and Beyond
Studies in computational aspects of voting: open problems of downey and fellows

The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity

The Multivariate Algorithmic Revolution and Beyond
Directed subset feedback vertex set is fixed-parameter tractable

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Clique cover and graph separation: new incompressibility results

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Parameterized tractability of multiway cut with parity constraints

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Deterministic parameterized connected vertex cover

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
A single-exponential FPT algorithm for the K4- minor cover problem

SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
On Parameterized Independent Feedback Vertex Set

Theoretical Computer Science
Feedback Vertex Sets in Tournaments

Journal of Graph Theory
Improved algorithms for the feedback vertex set problems

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Homomorphic hashing for sparse coefficient extraction

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Cycle transversals in perfect graphs and cographs

Theoretical Computer Science
Parameterized algorithms for even cycle transversal

WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
On group feedback vertex set parameterized by the size of the cutset

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

ACM Transactions on Algorithms (TALG)
Another disjoint compression algorithm for odd cycle transversal

Information Processing Letters
A faster FPT algorithm for Bipartite Contraction

Information Processing Letters
Fixed-parameter algorithms for Cochromatic Number and Disjoint Rectangle Stabbing via iterative localization

Information and Computation
Parameterized complexity of vertex deletion into perfect graph classes

Theoretical Computer Science
Beyond bidimensionality: Parameterized subexponential algorithms on directed graphs

Information and Computation

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present an O(mn) algorithm to determine whether a graph G with m edges and n vertices has an odd cycle transversal of order at most k, for any fixed k. We also obtain an algorithm that determines, in the same time, whether a graph has a half integral packing of odd cycles of weight k.