Planar vertex-disjoint cycle packing: new structures and improved kernel

DOI10.1007/978-3-319-71147-8_37MaRDI QIDQ1708648zbMATH OpenOpenAlexFDO

Authors Qilong Feng, Xiaolu Liao, Jianxin Wang

Publication date 26 March 2018

Full work available at URL https://doi.org/10.1007/978-3-319-71147-8_37

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs
• Improved kernels for several problems on planar graphs
• New kernels for several problems on planar graphs
• Kernelization of cycle packing with relaxed disjointness constraints
• Edge-disjoint packing of stars and cycles

Cited in

(15)

• Edge-disjoint packing of stars and cycles
• The parameterized complexity of cycle packing: indifference is not an issue
• A \((3+\epsilon)k\)-vertex kernel for edge-disjoint triangle packing
• Packing cycles faster than Erdős-Pósa
• A linear kernel for co-path/cycle packing
• Kernelization of cycle packing with relaxed disjointness constraints
• Kernelization of cycle packing with relaxed disjointness constraints
• Towards optimal kernel for edge-disjoint triangle packing
• A \(5k\)-vertex kernel for \(P_2\)-packing
• An improved kernel for planar vertex-disjoint triangle packing
• The parameterized complexity of cycle packing: indifference is not an issue
• New kernels for several problems on planar graphs
• A Linear Kernel for the k-Disjoint Cycle Problem on Planar Graphs
• Edge-disjoint packing of stars and cycles
• Improved kernels for several problems on planar graphs

This page was built for publication: Planar vertex-disjoint cycle packing: new structures and improved kernel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1708648)