A 5k kernel for P2-packing in net-free graphs

Given a graph G = (V, E), a P 2 -packing P is a collection of vertex disjoint copies of P 2 s in G where a P 2 is a simple path with three vertices and two edges. The kP 2 -Packing problem asks whether there exists a P 2 -packing of size k in G by taking graph G and a fixed parameter k as the input....

Celý popis

Podrobná bibliografia

Vydané v:	ICSEC : 2014 International Computer Science and Engineering Conference : July 30, 2014-August 1, 2014 s. 12 - 17
Hlavní autori:	Maw-Shang Chang, Li-Hsuan Chen, Ling-Ju Hung
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.07.2014
Predmet:	Algorithm design and analysis Bipartite graph Computer science Educational institutions Kernel kernelization algorithm net-free graphs P 2 -packing Particle separators Polynomials
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!