A 5k-vertex kernel for P2-packing

The P2-packing problem asks whether a graph contains k vertex-disjoint (not necessarily induced) paths each of length two. We continue the study of its kernelization algorithms, and develop a 5k-vertex kernel.

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 910; pp. 1 - 13
Main Authors: Li, Wenjun, Ye, Junjie, Cao, Yixin
Format: Journal Article
Language:English
Published: Elsevier B.V 02.04.2022
Subjects:
Crown decomposition
Kernelization algorithm
P2-packing
Crown decomposition
P2-packing
Kernelization algorithm
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The P2-packing problem asks whether a graph contains k vertex-disjoint (not necessarily induced) paths each of length two. We continue the study of its kernelization algorithms, and develop a 5k-vertex kernel.
AbstractList The P2-packing problem asks whether a graph contains k vertex-disjoint (not necessarily induced) paths each of length two. We continue the study of its kernelization algorithms, and develop a 5k-vertex kernel.
Author Ye, Junjie
Li, Wenjun
Cao, Yixin
Author_xml – sequence: 1
  givenname: Wenjun
  surname: Li
  fullname: Li, Wenjun
  email: liwenjun@csu.edu.cn
  organization: School of Computer and Communication Engineering, Changsha University of Science and Technology, Changsha, China
– sequence: 2
  givenname: Junjie
  surname: Ye
  fullname: Ye, Junjie
  email: junjie.ye@polyu.edu.hk
  organization: Department of Computing, Hong Kong Polytechnic University, Hong Kong, China
– sequence: 3
  givenname: Yixin
  surname: Cao
  fullname: Cao, Yixin
  email: yixin.cao@polyu.edu.hk
  organization: Department of Computing, Hong Kong Polytechnic University, Hong Kong, China
BookMark eNp9z8FKAzEQgOEgFWyrD-BtfYCsk2R3k-CpFK1CQQ96DtnsRNLW3ZKEom_vlnry0JnDnL6Bf0Ym_dAjIbcMSgasud-U2aWSA-clsBIEvyBTpqSmnOtqQqYgoKJCy_qKzFLawDi1bKbkblHUW3rAmPG72GLscVf4IRZvnO6t24b-85pcertLePN35-Tj6fF9-UzXr6uX5WJNnaggU6WwVh7BSmwbVteylZZXKK33Eq2XQqJqhew0U8C81k42CsZteed103AxJ-z018UhpYje7GP4svHHMDDHRrMxY6M5NhpgZmwcjfxnXMg2h6HP0YbdWflwkjgmHQJGk1zA3mEXIrpsuiGc0b8Xc2vI
CitedBy_id crossref_primary_10_1016_j_dam_2025_04_054
Cites_doi 10.1002/1097-0118(200104)36:4<175::AID-JGT1005>3.0.CO;2-T
10.1016/j.tcs.2005.10.009
10.1137/0202019
10.1137/0212040
10.1016/j.orl.2006.12.004
10.1016/0020-0190(94)90105-8
10.1002/jgt.10136
10.1016/j.ipl.2009.12.002
10.1016/j.dam.2010.05.001
10.1016/j.tcs.2019.04.018
ContentType Journal Article
Copyright 2022 Elsevier B.V.
Copyright_xml – notice: 2022 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.tcs.2022.01.032
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1879-2294
EndPage 13
ExternalDocumentID 10_1016_j_tcs_2022_01_032
S0304397522000470
GrantInformation_xml – fundername: Hong Kong Research Grants Council
  grantid: 15221420; 15201317
– fundername: National Natural Science Foundation of China
  grantid: 61972330
  funderid: https://doi.org/10.13039/501100001809
– fundername: National Natural Science Foundation of China
  grantid: 61872048
  funderid: https://doi.org/10.13039/501100001809
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1RT
1~.
1~5
4.4
457
4G.
5VS
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAXUO
AAYFN
ABAOU
ABBOA
ABJNI
ABMAC
ABYKQ
ACAZW
ACDAQ
ACGFS
ACRLP
ACZNC
ADBBV
ADEZE
AEBSH
AEKER
AENEX
AFKWA
AFTJW
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
AXJTR
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HVGLF
IHE
IXB
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
ROL
RPZ
SCC
SDF
SDG
SES
SPC
SPCBC
SSV
SSW
T5K
TN5
WH7
YNT
ZMT
~G-
29Q
9DU
AAEDT
AAQXK
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABEFU
ABFNM
ABWVN
ABXDB
ACLOT
ACNNM
ACRPL
ACVFH
ADCNI
ADMUD
ADNMO
ADVLN
AEIPS
AEUPX
AEXQZ
AFJKZ
AFPUW
AGHFR
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
ASPBG
AVWKF
AZFZN
CITATION
EFKBS
EJD
FGOYB
G-2
HZ~
R2-
SEW
SSZ
TAE
WUQ
ZY4
~HD
ID FETCH-LOGICAL-c340t-88e58fe0a7eb61557b7a24e7aff7eaf737e8b37d91801f99c7680808b2df96623
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000766621800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0304-3975
IngestDate Sat Nov 29 07:18:28 EST 2025
Tue Nov 18 22:37:48 EST 2025
Fri Feb 23 02:40:03 EST 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Keywords Crown decomposition
P2-packing
Kernelization algorithm
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c340t-88e58fe0a7eb61557b7a24e7aff7eaf737e8b37d91801f99c7680808b2df96623
OpenAccessLink https://www.sciencedirect.com/science/article/pii/S0304397522000470
PageCount 13
ParticipantIDs crossref_primary_10_1016_j_tcs_2022_01_032
crossref_citationtrail_10_1016_j_tcs_2022_01_032
elsevier_sciencedirect_doi_10_1016_j_tcs_2022_01_032
PublicationCentury 2000
PublicationDate 2022-04-02
PublicationDateYYYYMMDD 2022-04-02
PublicationDate_xml – month: 04
  year: 2022
  text: 2022-04-02
  day: 02
PublicationDecade 2020
PublicationTitle Theoretical computer science
PublicationYear 2022
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Hopcroft, Karp (br0050) 1973; 2
Kelmans (br0080) 2011; 159
Prieto, Sloper (br0120) 2006; 351
Kelmans, Mubayi (br0090) 2004; 45
Kirkpatrick, Hell (br0100) 1983; 12
Fellows (br0040) 2003
Cygan (br0030) 2013
Chang, Chen, Hung (br0010) 2014
Monnot, Toulouse (br0110) 2007; 35
Wang, Ning, Feng, Chen (br0130) 2010; 110
Xiao, Kou (br0140) 2017
Kann (br0070) 1994; 49
Chen, Fernau, Shaw, Wang, Yang (br0020) 2019; 790
Kaneko, Kelmans, Nishimura (br0060) 2001; 36
Chang (10.1016/j.tcs.2022.01.032_br0010) 2014
Kaneko (10.1016/j.tcs.2022.01.032_br0060) 2001; 36
Chen (10.1016/j.tcs.2022.01.032_br0020) 2019; 790
Hopcroft (10.1016/j.tcs.2022.01.032_br0050) 1973; 2
Kelmans (10.1016/j.tcs.2022.01.032_br0090) 2004; 45
Monnot (10.1016/j.tcs.2022.01.032_br0110) 2007; 35
Prieto (10.1016/j.tcs.2022.01.032_br0120) 2006; 351
Fellows (10.1016/j.tcs.2022.01.032_br0040) 2003
Wang (10.1016/j.tcs.2022.01.032_br0130) 2010; 110
Cygan (10.1016/j.tcs.2022.01.032_br0030) 2013
Kirkpatrick (10.1016/j.tcs.2022.01.032_br0100) 1983; 12
Xiao (10.1016/j.tcs.2022.01.032_br0140) 2017
Kann (10.1016/j.tcs.2022.01.032_br0070) 1994; 49
Kelmans (10.1016/j.tcs.2022.01.032_br0080) 2011; 159
References_xml – volume: 36
  start-page: 175
  year: 2001
  end-page: 197
  ident: br0060
  article-title: On packing 3-vertex paths in a graph
  publication-title: J. Graph Theory
– volume: 110
  start-page: 188
  year: 2010
  end-page: 192
  ident: br0130
  article-title: An improved kernelization for
  publication-title: Inf. Process. Lett.
– volume: 35
  start-page: 677
  year: 2007
  end-page: 684
  ident: br0110
  article-title: The path partition problem and related problems in bipartite graphs
  publication-title: Oper. Res. Lett.
– volume: 351
  start-page: 437
  year: 2006
  end-page: 445
  ident: br0120
  article-title: Looking at the stars
  publication-title: Theor. Comput. Sci.
– start-page: 12
  year: 2014
  end-page: 17
  ident: br0010
  article-title: A 5
  publication-title: 2014 International Computer Science and Engineering Conference (ICSEC)
– volume: 12
  start-page: 601
  year: 1983
  end-page: 609
  ident: br0100
  article-title: On the complexity of general graph factor problems
  publication-title: SIAM J. Comput.
– start-page: 654
  year: 2017
  end-page: 668
  ident: br0140
  article-title: Kernelization and parameterized algorithms for 3-path vertex cover
  publication-title: Theory and Applications of Models of Computation
– start-page: 1
  year: 2003
  end-page: 12
  ident: br0040
  article-title: Blow-ups, win/win's, and crown rules: some new directions in FPT
  publication-title: Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science
– volume: 49
  start-page: 309
  year: 1994
  end-page: 318
  ident: br0070
  article-title: Maximum bounded
  publication-title: Inf. Process. Lett.
– start-page: 509
  year: 2013
  end-page: 518
  ident: br0030
  article-title: Improved approximation for 3-dimensional matching via bounded pathwidth local search
  publication-title: Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science
– volume: 159
  start-page: 112
  year: 2011
  end-page: 127
  ident: br0080
  article-title: Packing 3-vertex paths in claw-free graphs and related topics
  publication-title: Discrete Appl. Math.
– volume: 790
  start-page: 152
  year: 2019
  end-page: 166
  ident: br0020
  article-title: Kernels for packing and covering problems
  publication-title: Theor. Comput. Sci.
– volume: 45
  start-page: 57
  year: 2004
  end-page: 79
  ident: br0090
  article-title: How many disjoint 2-edge paths must a cubic graph have?
  publication-title: J. Graph Theory
– volume: 2
  start-page: 225
  year: 1973
  end-page: 231
  ident: br0050
  article-title: An
  publication-title: SIAM J. Comput.
– volume: 36
  start-page: 175
  issue: 4
  year: 2001
  ident: 10.1016/j.tcs.2022.01.032_br0060
  article-title: On packing 3-vertex paths in a graph
  publication-title: J. Graph Theory
  doi: 10.1002/1097-0118(200104)36:4<175::AID-JGT1005>3.0.CO;2-T
– start-page: 654
  year: 2017
  ident: 10.1016/j.tcs.2022.01.032_br0140
  article-title: Kernelization and parameterized algorithms for 3-path vertex cover
– volume: 351
  start-page: 437
  issue: 3
  year: 2006
  ident: 10.1016/j.tcs.2022.01.032_br0120
  article-title: Looking at the stars
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2005.10.009
– volume: 2
  start-page: 225
  issue: 4
  year: 1973
  ident: 10.1016/j.tcs.2022.01.032_br0050
  article-title: An n5/2 algorithm for maximum matchings in bipartite graphs
  publication-title: SIAM J. Comput.
  doi: 10.1137/0202019
– volume: 12
  start-page: 601
  issue: 3
  year: 1983
  ident: 10.1016/j.tcs.2022.01.032_br0100
  article-title: On the complexity of general graph factor problems
  publication-title: SIAM J. Comput.
  doi: 10.1137/0212040
– start-page: 12
  year: 2014
  ident: 10.1016/j.tcs.2022.01.032_br0010
  article-title: A 5k kernel for P2-packing in net-free graphs
– volume: 35
  start-page: 677
  issue: 5
  year: 2007
  ident: 10.1016/j.tcs.2022.01.032_br0110
  article-title: The path partition problem and related problems in bipartite graphs
  publication-title: Oper. Res. Lett.
  doi: 10.1016/j.orl.2006.12.004
– volume: 49
  start-page: 309
  issue: 6
  year: 1994
  ident: 10.1016/j.tcs.2022.01.032_br0070
  article-title: Maximum bounded H-matching is MAX SNP-complete
  publication-title: Inf. Process. Lett.
  doi: 10.1016/0020-0190(94)90105-8
– volume: 45
  start-page: 57
  issue: 1
  year: 2004
  ident: 10.1016/j.tcs.2022.01.032_br0090
  article-title: How many disjoint 2-edge paths must a cubic graph have?
  publication-title: J. Graph Theory
  doi: 10.1002/jgt.10136
– start-page: 509
  year: 2013
  ident: 10.1016/j.tcs.2022.01.032_br0030
  article-title: Improved approximation for 3-dimensional matching via bounded pathwidth local search
– start-page: 1
  year: 2003
  ident: 10.1016/j.tcs.2022.01.032_br0040
  article-title: Blow-ups, win/win's, and crown rules: some new directions in FPT
– volume: 110
  start-page: 188
  issue: 5
  year: 2010
  ident: 10.1016/j.tcs.2022.01.032_br0130
  article-title: An improved kernelization for P2-packing
  publication-title: Inf. Process. Lett.
  doi: 10.1016/j.ipl.2009.12.002
– volume: 159
  start-page: 112
  issue: 2–3
  year: 2011
  ident: 10.1016/j.tcs.2022.01.032_br0080
  article-title: Packing 3-vertex paths in claw-free graphs and related topics
  publication-title: Discrete Appl. Math.
  doi: 10.1016/j.dam.2010.05.001
– volume: 790
  start-page: 152
  year: 2019
  ident: 10.1016/j.tcs.2022.01.032_br0020
  article-title: Kernels for packing and covering problems
  publication-title: Theor. Comput. Sci.
  doi: 10.1016/j.tcs.2019.04.018
SSID ssj0000576
Score 2.3569345
Snippet The P2-packing problem asks whether a graph contains k vertex-disjoint (not necessarily induced) paths each of length two. We continue the study of its...
SourceID crossref
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 1
SubjectTerms Crown decomposition
Kernelization algorithm
P2-packing
Title A 5k-vertex kernel for P2-packing
URI https://dx.doi.org/10.1016/j.tcs.2022.01.032
Volume 910
WOSCitedRecordID wos000766621800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000576
  issn: 0304-3975
  databaseCode: AIEXJ
  dateStart: 20211212
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3dT9swED9B2QM8bIwNARtTJvG0yihxPmw_VogJJoGQAFGeIidxpKYoVP1A_fM5x47L-NKGxEtURXHr-Hc9353v7gewV_pxiVY9aj8mCxLllBOehxEpcLtVSaH74RmyCXZ6yvt9cWaJCycNnQCraz6fi9G7Qo33EGxdOvsfcLsvxRv4GUHHK8KO138CvteNh0SzLKt5d6jGtWoqFLtnlKB7PGx3qspJiatjzC3BQ9fuii5Xpznwv1J1NXOSdG1C77O6GrjnDmQTdr0ezG03bxtMQD9U56AsXM-nVS6mskqfngjDcLKvjKLkTBBKDUFxq0mFzVA1ujB4sKmaetMn6tpEDqr9aa47p1PadFC18c6_u2Cf60noOVBdWxQxfxlWKIsF78BK7_iw_2ex_cbMHFDbSbdH2U1S36Mfet4YeWBgXKzDR-sZeD2D6GdYUvUGfGpZNzyrhDdg7cR12p18gZ89z8HtGbg9hNtbwP0VLn8fXhwcEUt7QfBP4k8J5yrmpfKlpqtBc49lTNJIMVmWTMmShUzxLGSFCNC6KIXImaZP8XlGixKdVxpuQqe-rdUWeImMREBlwrkMoyQLZJJRUURSFaJQvmDb4Lfvn-a2J7ymJrlJ2-S_KsUlS_WSpX6Q4pJtwy83ZGQaorz2cNQuampl11hqKUrAy8N23jbsG6wuZPo7dKbjmdqFD_nddDAZ_7Bycg-fFGhk
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+5k-vertex+kernel+for+P2-packing&rft.jtitle=Theoretical+computer+science&rft.au=Li%2C+Wenjun&rft.au=Ye%2C+Junjie&rft.au=Cao%2C+Yixin&rft.date=2022-04-02&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=910&rft.spage=1&rft.epage=13&rft_id=info:doi/10.1016%2Fj.tcs.2022.01.032&rft.externalDocID=S0304397522000470
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon