A 5k-vertex kernel for P₂-packing
From MaRDI portal
Publication:2118855
DOI10.1016/J.TCS.2022.01.032OpenAlexW2796325722MaRDI QIDQ2118855FDOQ2118855
Authors: Wen-Jun Li, Junjie Ye, Yixin Cao 
Publication date: 23 March 2022
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2022.01.032
Recommendations
- An improved kernelization for \(P_{2}\)-packing
- Packing of \(K_{v}\) with certain graphs of five vertices
- scientific article; zbMATH DE number 2114468
- Kernelization for \(P_2\)-packing: a gerrymandering approach
- A Problem Kernelization for Graph Packing
- Kernels for Packing and Covering Problems
- A note to maximum packings of \(K_v\) with a graph \(G\) of five vertices and five edges
- An improved kernel for planar vertex-disjoint triangle packing
- A \(5k\)-vertex kernel for 3-path vertex cover
- Planar vertex-disjoint cycle packing: new structures and improved kernel
Cites Work
- On the Complexity of General Graph Factor Problems
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Looking at the stars
- Graph-Theoretic Concepts in Computer Science
- Maximum bounded \(H\)-matching is Max SNP-complete
- The path partition problem and related problems in bipartite graphs
- An improved kernelization for \(P_{2}\)-packing
- Kernels for packing and covering problems
- How many disjoint 2-edge paths must a cubic graph have?
- Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
- On packing 3-vertex paths in a graph
- Packing 3-vertex paths in claw-free graphs and related topics
Cited In (2)
This page was built for publication: A \(5k\)-vertex kernel for \(P_2\)-packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2118855)
