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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of combinatorial theory. Series B Jg. 177; S. 143 - 185
Hauptverfasser:	Lokshtanov, Daniel, Ramanujan, M.S., Saurabh, Saket
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 01.03.2026
Schlagworte:	Directed graphs Feedback vertex set Fixed-parameter algorithms Feedback vertex set Directed graphs Fixed-parameter algorithms
ISSN:	0095-8956
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!