Obtaining split graphs by edge contraction

We study the parameterized complexity of the following Split Contraction problem: Given a graph G, and an integer k as parameter, determine whether G can be modified into a split graph by contracting at most k edges. We show that Split Contraction can be solved in FPT time 2O(k2)n5, but admits no po...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 607; s. 60 - 67
Hlavní autori:	Guo, Chengwei, Cai, Leizhen
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 23.11.2015
Predmet:	Complexity Contraction Edge contraction FPT algorithm Graph theory Graphs Incompressibility Integers Kernels Parameterized complexity Polynomials Split graphs Split graphs FPT algorithm Edge contraction Incompressibility Parameterized complexity
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!