A Parameterized Perspective on Packing Paths of Length Two
DOI10.1007/978-3-540-85097-7_6zbMATH Open1168.05358OpenAlexW1500219622MaRDI QIDQ5505643FDOQ5505643
Authors: Henning Fernau, Daniel Raible 
Publication date: 27 January 2009
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_6
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Approximation algorithms for the test cover problem
- Title not available (Why is that?)
- An Improved Parameterized Algorithm for a Generalized Matching Problem
- An efficient parameterized algorithm for m-set packing
- On the completeness of a generalized matching problem
- An approximation algorithm for maximum packing of 3-edge paths
- Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
- Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms
- An O *(3.523k ) Parameterized Algorithm for 3-Set Packing
- An approximation algorithm for maximum triangle packing
- Parameterized and Exact Computation
- Title not available (Why is that?)
Cited In (8)
- Randomized Adaptive Test Cover
- Shortest \((A+B)\)-path packing via hafnian
- A parameterized perspective on packing paths of length two
- Deterministic versus randomized adaptive test cover
- The parameterized complexity of the induced matching problem
- Vertex and edge covers with clustering properties: Complexity and algorithms
- A Problem Kernelization for Graph Packing
- Packings and 2-packings of A-paths
This page was built for publication: A Parameterized Perspective on Packing Paths of Length Two
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505643)
