An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem

DOI10.1007/978-3-642-40164-0_11zbMath1302.68211OpenAlexW997982MaRDI QIDQ2842775

Yixin Cao, Jia-Hao Fan, Jian'er Chen

Publication date: 16 August 2013

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40164-0_11

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

This page was built for publication: An O *(1.84 k ) Parameterized Algorithm for the Multiterminal Cut Problem