Parameterized algorithms for inclusion of linear matchings

DOI10.1007/978-3-642-25591-5_37MaRDI QIDQ3104630zbMATH OpenOpenAlexFDO

Authors Sylvain Guillemot

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

Mathematics Subject Classification ID

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) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Almost induced matching: linear kernels and parameterized algorithms
• Parameterized matching on non-linear structures
• Parameterized algorithms and kernels for almost induced matching
• scientific article; zbMATH DE number 1496857
• Sublinear Algorithms for Parameterized Matching

Cited in

(6)

• Parameterized algorithmics for linear arrangement problems
• Parameterized algorithms for stable matching with ties and incomplete lists
• Parameterized algorithms and kernels for almost induced matching
• Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings
• Common Structured Patterns in Linear Graphs: Approximation and Combinatorics
• Sublinear Algorithms for Parameterized Matching

This page was built for publication: Parameterized algorithms for inclusion of linear matchings

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