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

We show that the NP-complete Feedback Vertex Set problem, which asks for the smallest set of vertices to remove from a graph to destroy all cycles, is deterministically solvable in O ( c k ⋅ m ) time. Here, m denotes the number of graph edges, k denotes the size of the feedback vertex set searched f...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of computer and system sciences Jg. 72; H. 8; S. 1386 - 1396
Hauptverfasser:	Guo, Jiong, Gramm, Jens, Hüffner, Falk, Niedermeier, Rolf, Wernicke, Sebastian
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.12.2006
Schlagworte:	Feedback set problem Fixed-parameter tractability Graph algorithm Graph modification problem Iterative compression Iterative compression Feedback set problem Fixed-parameter tractability Graph modification problem Graph algorithm
ISSN:	0022-0000, 1090-2724
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!