When recursion is better than iteration: A linear-time algorithm for directed acyclicity with few error vertices

Planarity, bipartiteness and (directed) acyclicity are basic graph properties with classic linear-time recognition algorithms. However, the problems of testing whether a given graph has k vertices whose deletion makes it planar, bipartite or a directed acyclic graph (DAG) are all fundamental NP-comp...

Celý popis

Podrobná bibliografie

Vydáno v:	Journal of combinatorial theory. Series B Ročník 177; s. 143 - 185
Hlavní autoři:	Lokshtanov, Daniel, Ramanujan, M.S., Saurabh, Saket
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Inc 01.03.2026
Témata:	Directed graphs Feedback vertex set Fixed-parameter algorithms Feedback vertex set Directed graphs Fixed-parameter algorithms
ISSN:	0095-8956
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!