A Parameterized Algorithm for Mixed-Cut

DOI10.1007/978-3-662-49529-2_50zbMath1476.68216arXiv1509.05612OpenAlexW2964242556MaRDI QIDQ2802977

Ashutosh Rai, Saket Saurabh, M. S. Ramanujan

Publication date: 3 May 2016

Published in: LATIN 2016: Theoretical Informatics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (3)

Reducing CMSO model checking to highly connected graphs ⋮ On the complexity of computing the \(k\)-restricted edge-connectivity of a graph ⋮ The complexity of mixed-connectivity

This page was built for publication: A Parameterized Algorithm for Mixed-Cut