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žené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 662; s. 31 - 39
Hlavní autori:	Montejano, Luis Pedro, Sau, Ignasi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.02.2017 Elsevier
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!