Another disjoint compression algorithm for odd cycle transversal

DOI10.1016/j.ipl.2013.08.007zbMath1284.68719OpenAlexW2083367669MaRDI QIDQ2445321

R. Krithika, N. S. Narayanaswamy

Publication date: 14 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2013.08.007

zbMATH Keywords

graph algorithmsparameterized complexityabove guarantee vertex coverodd cycle transversaldisjoint compression

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

An FPT algorithm for the vertex cover \(P_4\) problem ⋮ The Parameterized Complexity of Finding Point Sets with Hereditary Properties ⋮ Approximability of clique transversal in perfect graphs

Cites Work

• Unnamed Item
• Finding odd cycle transversals.
• Algorithm Engineering for Optimal Graph Bipartization
• Simpler Parameterized Algorithm for OCT
• Faster Parameterized Algorithms Using Linear Programming
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems

This page was built for publication: Another disjoint compression algorithm for odd cycle transversal