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...

Celý popis

Podrobná bibliografia

Vydané v:	Journal of computer and system sciences Ročník 72; číslo 8; s. 1386 - 1396
Hlavní autori:	Guo, Jiong, Gramm, Jens, Hüffner, Falk, Niedermeier, Rolf, Wernicke, Sebastian
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.12.2006
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!