Parameterized Algorithms and Kernels for Rainbow Matching
From MaRDI portal
(Redirected from Publication:5111288)
3-dimensional matching3-set packingbounded search treesdivide-and-conquerparameterized algorithmrainbow matching
Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
Cites work
- A measure \& conquer approach for the analysis of exact algorithms
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An improved kernelization algorithm for \(r\)-set packing
- Complexity results for rainbow matchings
- Edge Dominating Sets in Graphs
- Exact exponential algorithms.
- Fundamentals of parameterized complexity
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Kernelization of packing problems
- Matching theory
- Mixing Color Coding-Related Techniques
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Narrow sieves for parameterized paths and packings
- NP-completeness of some generalizations of the maximum matching problem
- Parameterized algorithms
- Paths, Trees, and Flowers
- Some Matching Problems for Bipartite Graphs
Cited in
(4)
This page was built for publication: Parameterized Algorithms and Kernels for Rainbow Matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111288)
