On Algorithms Employing Treewidth for $L$-bounded Cut Problems

From MaRDI portal
Publication:4637663

DOI10.7155/jgaa.00462zbMath1384.05147arXiv1705.02390OpenAlexW2790988318MaRDI QIDQ4637663

Petr Kolman

Publication date: 25 April 2018

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1705.02390




Related Items (6)



Cites Work


This page was built for publication: On Algorithms Employing Treewidth for $L$-bounded Cut Problems