Solving Multicut Faster Than 2 n

DOI10.1007/978-3-662-44777-2_55zbMath1425.05154OpenAlexW625834111MaRDI QIDQ2921452

Saket Saurabh, Ondřej Suchý, Daniel Lokshtanov

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-44777-2_55

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Faster exact algorithms for some terminal set problems

This page was built for publication: Solving Multicut Faster Than 2 n