ON DISJOINT CYCLES

DOI10.1142/S0129054194000049zbMath0803.05030MaRDI QIDQ4304619

Hans L. Bodlaender

Publication date: 2 January 1995

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

treewidth; linear time algorithm; feedback vertex set; tree-decomposition; disjoint cycles

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C38: Paths and cycles

68W10: Parallel algorithms in computer science

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

A partial k-arboretum of graphs with bounded treewidth, On interval routing schemes and treewidth