Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization

2006/03/10 by Jiong Guo, Jens Gramm, Falk Hüffner +2 · 4 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Artificial intelligence #Combinatorics #Complexity and Algorithms in Graphs #Compression (physics) #Computer science #Discrete mathematics #Enhanced Data Rates for GSM Evolution #Feedback vertex set #Graph #Mathematics #Optimization and Search Problems #Physics #Set (abstract data type) #Theoretical computer science #Vertex (graph theory)

paper · doi:10.1016/j.jcss.2006.02.001

openalex publication_date 2006/03/10 · crossref created 2006/03/10 · crossref issued 2006/12/01 · crossref published 2006/12/01 · crossref published-print 2006/12/01 · crossref deposited 2019/04/17 · openalex created_date 2025/10/10 · crossref indexed 2026/06/04 · openalex updated_date 2026/07/23

Citations

• Invitation to Fixed-Parameter Algorithms
• Finding odd cycle transversals
• Fixed-parameter tractability and completeness II: On completeness for W[1]

Cited by

• On Feedback Vertex Set New Measure and New Structures
• A fixed-parameter algorithm for the directed feedback vertex set problem
• Improved algorithms for feedback vertex set problems
• Bipartite graph [wikipedia]