Minimum Degree up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2015

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

Résumé

The local minimum degree of a graph is the minimum degree that can be reached by means of local complementation. For any n, there exist graphs of order n which have a local minimum degree at least 0.189n, or at least 0.110n when restricted to bipartite graphs. Regarding the upper bound, we show that for any graph of order n, its local minimum degree is at most 3n/8+o(n) and n/4+o(n) for bipartite graphs, improving the known n/2 upper bound. We also prove that the local minimum degree is smaller than half of the vertex cover number (up to a logarithmic term). The local minimum degree problem is NP-Complete and hard to approximate. We show that this problem, even when restricted to bipartite graphs, is in W[2] and FPT-equivalent to the EvenSet problem, which W[1]-hardness is a long standing open question. Finally, we show that the local minimum degree is computed by a O*(1.938^n)-algorithm, and a O*(1.466^n)-algorithm for the bipartite graphs.

Dates et versions

hal-01132843 , version 1 (18-03-2015)

Identifiants

Citer

David Cattanéo, Simon Perdrix. Minimum Degree up to Local Complementation: Bounds, Parameterized Complexity, and Exact Algorithms. 26th International Symposium on Algorithms and Computation (ISAAC 2015), Dec 2015, Nagoya, Japan. pp.12, ⟨10.1007/978-3-662-48971-0_23⟩. ⟨hal-01132843⟩
125 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More