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

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 exte...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 662; pp. 31 - 39
Main Authors:	Montejano, Luis Pedro, Sau, Ignasi
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.02.2017 Elsevier
Subjects:	Algorithms Combinatorial analysis Communities Complexity Computation FPT-algorithm Good edge separation Graph cut Graph theory Graphs Invariants k-Restricted edge-connectivity Mathematics Parameterized complexity Polynomial kernel Good edge separation Graph cut k-Restricted edge-connectivity Polynomial kernel Parameterized complexity FPT-algorithm k-restricted edge-connectivity
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!