Improved Fixed-Parameter Algorithms for Two Feedback Set Problems

Improved Fixed-Parameter Algorithms for Two Feedback Set Problems

Settling a ten years open question, we show that the NP-complete Feedback Vertex Set problem is deterministically solvable in O(ck · m) time, where m denotes the number of graph edges, k denotes the size of the feedback vertex set searched for, and c is a constant. As a second result, we present a f...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Guo, Jiong, Gramm, Jens, Hüffner, Falk, Niedermeier, Rolf, Wernicke, Sebastian
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Algorithmics. Computability. Computer arithmetics
Applied sciences
Bipartite Graph
Candidate Vertex
Combinatorial Explosion
Compression Step
Computer science
control theory
systems
Data Reduction Process
Exact sciences and technology
Theoretical computing
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Settling a ten years open question, we show that the NP-complete Feedback Vertex Set problem is deterministically solvable in O(ck · m) time, where m denotes the number of graph edges, k denotes the size of the feedback vertex set searched for, and c is a constant. As a second result, we present a fixed-parameter algorithm for the NP-complete Edge Bipartization problem with runtime O(2k · m2).
ISSN:0302-9743
1611-3349
DOI:10.1007/11534273_15