Parameterized complexity of length-bounded cuts and multicuts
From MaRDI portal
Publication:1799212
DOI10.1007/s00453-018-0408-7zbMath1400.90258arXiv1511.02801MaRDI QIDQ1799212
Publication date: 18 October 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.02801
parameterized algorithms; tree-width; polynomial kernel; tree-depth; length-bounded cuts; \(\mathsf{W}[1\)-hardness]
90C35: Programming involving graphs or networks
90C27: Combinatorial optimization
05C12: Distance in graphs
Uses Software