Algorithms for Cut Problems on Trees
From MaRDI portal
Publication:2942406
DOI10.1007/978-3-319-12691-3_22zbMath1409.05197arXiv1304.3653OpenAlexW1586356312MaRDI QIDQ2942406
Guo-Hui Lin, Ge Xia, Boting Yang, Weitian Tong, Jinhui Xu, Tian Liu, Peng Zhang, Fenghui Zhang, Binhai Zhu, Iyad A. Kanj
Publication date: 11 September 2015
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1304.3653
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
Parameterized complexity of weighted multicut in trees ⋮ Parameterized complexity of multicut in weighted trees ⋮ Improved parameterized and exact algorithms for cut problems on trees
This page was built for publication: Algorithms for Cut Problems on Trees