On the complexity of computing the k-restricted edge-connectivity of a graph - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Theoretical Computer Science Year : 2017

On the complexity of computing the k-restricted edge-connectivity of a graph

Ignasi Sau

Abstract

The k-restricted edge-connectivity of a graph G, denoted by λ k (G), is defined as the minimum size of an edge set whose removal leaves exactly two connected components each containing at least k vertices. This graph invariant, which can be seen as a generalization of a minimum edge-cut, has been extensively studied from a combinatorial point of view. However, very little is known about the complexity of computing λ k (G). Very recently, in the parameterized complexity community the notion of good edge separation of a graph has been defined, which happens to be essentially the same as the k-restricted edge-connectivity. Motivated by the relevance of this invariant from both combinatorial and algorithmic points of view, in this article we initiate a systematic study of its computational complexity, with special emphasis on its parameterized complexity for several choices of the parameters. We provide a number of NP-hardness and W[1]-hardness results, as well as FPT-algorithms.
Fichier principal
Vignette du fichier
1502.07659v2.pdf (500.14 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

lirmm-01481786 , version 1 (20-12-2019)

Identifiers

Cite

Luis Pedro Montejano, Ignasi Sau. On the complexity of computing the k-restricted edge-connectivity of a graph. Theoretical Computer Science, 2017, 662, pp.31-39. ⟨10.1016/j.tcs.2016.12.006⟩. ⟨lirmm-01481786⟩
130 View
72 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More