Packing edge disjoint triangles: A parameterized view

DOI10.1007/978-3-540-28639-4_12MaRDI QIDQ5311506zbMATH OpenOpenAlexFDO

Authors Luke Mathieson, Elena Prieto, Peter J. A. Shaw

Publication date 23 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100584

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) General topics in the theory of algorithms (68W01) Nonnumerical algorithms (68W05)

Recommendations

• A (3+)k-vertex kernel for edge-disjoint triangle packing
• Towards optimal kernel for edge-disjoint triangle packing
• Edge-disjoint packing of stars and cycles
• Edge-disjoint packing of stars and cycles
• A Problem Kernelization for Graph Packing

Cited in

(22)

• A (3+)k-vertex kernel for edge-disjoint triangle packing
• Narrow sieves for parameterized paths and packings
• An \(O^{*}(3.53^{3k})\)-time parameterized algorithm for the 3-set packing problem
• Towards optimal kernel for edge-disjoint triangle packing
• Crown reductions for the minimum weighted vertex cover problem
• Edge-disjoint packing of stars and cycles
• Parameterized counting matching and packing: a family of hard problems that admit FPTRAS
• An improved kernel for planar vertex-disjoint triangle packing
• Edge-disjoint packing of stars and cycles
• scientific article; zbMATH DE number 1960287 (Why is no real title available?)
• On counting parameterized matching and packing
• Confronting intractability via parameters
• Graph-Theoretic Concepts in Computer Science
• Kernelization of packing problems
• Kernel bounds for disjoint cycles and disjoint paths
• Kernelization for edge triangle packing and covering via a discharging method
• A discharging method: improved kernels for edge triangle packing and covering
• Approximate Turing kernelization for problems parameterized by treewidth
• Improved upper bounds for vertex cover
• Hardness and approximation of traffic grooming
• Parameterized algorithms for weighted matching and packing problems
• Algorithm engineering for color-coding with applications to signaling pathway detection

This page was built for publication: Packing edge disjoint triangles: A parameterized view

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