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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 662; s. 31 - 39
Hlavní autoři:	Montejano, Luis Pedro, Sau, Ignasi
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.02.2017 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!