A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem

DOI10.33048/daio.2021.28.710zbMath1496.05027OpenAlexW4205762140MaRDI QIDQ5100142

Artëm Gennadievich Klyuchikov, Mikhail N. Vyalyi

Publication date: 29 August 2022

Published in: Diskretnyi analiz i issledovanie operatsii (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/da1288

zbMATH Keywords

spanning treepath decompositionFPT\(k\)-LST problemwin-win algorithm

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Quickly excluding a forest
• NP-completeness and degree restricted spanning trees
• Graph Minors I: A Short Proof of the Path-width Theorem

This page was built for publication: A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem