Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms

DOI10.1007/978-3-662-48971-0_23zbMath1472.68110arXiv1503.04702MaRDI QIDQ3459866

Simon Perdrix, David Cattanéo

Publication date: 11 January 2016

Published in: Algorithms and Computation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68W05: Nonnumerical algorithms

68R10: Graph theory (including graph drawing) in computer science

05C07: Vertex degrees

68Q27: Parameterized complexity, tractability and kernelization