Scalable Kernelization for Maximum Independent Sets

DOI10.1137/1.9781611975055.19zbMath1430.68217arXiv1708.06151OpenAlexW2749469150MaRDI QIDQ5232741

Darren Strash, Christian Schulz, Demian Hespe

Publication date: 12 September 2019

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

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

Preprocessing to reduce the search space: antler structures for feedback vertex set ⋮ Unnamed Item

This page was built for publication: Scalable Kernelization for Maximum Independent Sets