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

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

David Cattanéo, Simon Perdrix

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

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Vertex degrees (05C07) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (2)

A survey of parameterized algorithms and the complexity of edge modification ⋮ Contextuality in multipartite pseudo-telepathy graph games

This page was built for publication: Minimum Degree Up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms