Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/79379
Title: Kernelization for P2-packing : a gerrymandering approach
Authors: Li, W
Ye, J 
Cao, Y 
Issue Date: 2018
Publisher: Springer Verlag
Source: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2018, v. 10823 LNCS, p. 140-153 How to cite?
Journal: Lecture notes in computer science (including subseries Lecture notes in artificial intelligence and lecture notes in bioinformatics) 
Abstract: The P2-packing problem asks for whether a graph contains k vertex-disjoint paths each of length two. We continue the study of its kernelization algorithms, and develop a 5k-vertex kernel.
Description: 12th International Frontiers of Algorithmics Workshop, FAW 2018, Guangzhou, China, 8-10 May 2018
URI: http://hdl.handle.net/10397/79379
ISBN: 9783319784540
ISSN: 0302-9743
EISSN: 1611-3349
DOI: 10.1007/978-3-319-78455-7_11
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

36
Last Week
0
Last month
Citations as of Jul 16, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.