Parameterized Algorithms and Kernels for Rainbow Matching
DOI10.4230/LIPICS.MFCS.2017.71zbMATH Open1435.68237OpenAlexW3163427696MaRDI QIDQ5111288FDOQ5111288
Authors: Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi 
Publication date: 26 May 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.MFCS.2017.71
Recommendations
divide-and-conquer3-dimensional matchingparameterized algorithmrainbow matching3-set packingbounded search trees
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parameterized complexity, tractability and kernelization (68Q27)
Cites Work
- Fundamentals of parameterized complexity
- Title not available (Why is that?)
- A measure & conquer approach for the analysis of exact algorithms
- Paths, Trees, and Flowers
- Exact exponential algorithms.
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
- Narrow sieves for parameterized paths and packings
- Matching theory
- Mixing Color Coding-Related Techniques
- Parameterized Algorithms
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Some Matching Problems for Bipartite Graphs
- Edge Dominating Sets in Graphs
- Title not available (Why is that?)
- An improved kernelization algorithm for \(r\)-set packing
- NP-completeness of some generalizations of the maximum matching problem
- Complexity results for rainbow matchings
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)
