A parameterized perspective on packing paths of length two
type: Item
instance of: scholarly article
title: A parameterized perspective on packing paths of length two
zbMATH Open document ID: 1184.90136
author: Henning Fernau
author: Daniel Raible
published in: Journal of Combinatorial Optimization
publication date: 2010-02-24T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5674590
zbMATH Keywords: parameterized algorithms
zbMATH Keywords: extremal combinatorics
MaRDI profile type: Publication
OpenAlex ID: W2797447161
cites work: Approximation algorithms for some vehicle routing problems
cites work: Approximation algorithms for the test cover problem
cites work: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
cites work: The \(k\)-feature set problem is \(W[2]\)-complete
cites work: SOFSEM 2006: Theory and Practice of Computer Science
cites work: Q4417671
cites work: SOFSEM 2005: Theory and Practice of Computer Science
cites work: A Parameterized Perspective on Packing Paths of Length Two
cites work: Q3270978
cites work: An approximation algorithm for maximum packing of 3-edge paths
cites work: An approximation algorithm for maximum triangle packing
cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
cites work: Parameterized complexity of finding subgraphs with hereditary properties.
cites work: On the completeness of a generalized matching problem
cites work: Q3576691
cites work: Greedy Localization and Color-Coding: Improved Matching and Packing Algorithms
cites work: The P k Partition Problem and Related Problems in Bipartite Graphs
cites work: A Problem Kernelization for Graph Packing
cites work: Equivalence between the minimum covering problem and the maximum matching problem
cites work: Algorithms and Data Structures
cites work: Parameterized and Exact Computation
cites work: An Improved Parameterized Algorithm for a Generalized Matching Problem
DOI: 10.1007/S10878-009-9230-0
description: scientific article; zbMATH DE number 5674590