Parameterized Algorithms for Inclusion of Linear Matchings
From MaRDI portal
Publication:3104630
DOI10.1007/978-3-642-25591-5_37zbMath1350.68140OpenAlexW149762641MaRDI QIDQ3104630
Publication date: 16 December 2011
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-25591-5_37
Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
This page was built for publication: Parameterized Algorithms for Inclusion of Linear Matchings
