Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover

DOI10.1137/1.9781611973754.7zbMATH Open1429.68164OpenAlexW1890558254MaRDI QIDQ5232523

Takuya Akiba, Yoichi Iwata

Publication date: 12 September 2019

Published in: 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973754.7

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (1)

Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover

This page was built for publication: Branch-and-Reduce Exponential/FPT Algorithms in Practice: A Case Study of Vertex Cover