Diverse Pairs of Matchings
From MaRDI portal
Publication:6065425
DOI10.4230/lipics.isaac.2020.26arXiv2009.04567OpenAlexW3116915069MaRDI QIDQ6065425
Petr A. Golovach, Fedor V. Fomin, Danil Sagunov, Geevarghese Philip, Lars Jaffke
Publication date: 14 November 2023
Full work available at URL: https://arxiv.org/abs/2009.04567
Related Items
Obtaining approximately optimal and diverse solutions via dispersion, Diverse collections in matroids and graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Beyond the Vizing's Bound for at Most Seven Colors
- Maximum matchings in general graphs through randomization
- The NP-Completeness of Edge-Coloring
- Faster scaling algorithms for general graph matching problems
- Color-coding
- Kernelization
- On Representatives of Subsets
- Handbook of Computational Social Choice
- Paths, Trees, and Flowers
- Algorithms – ESA 2004
- Parameterized Algorithms
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- A Short Proof of the Factor Theorem for Finite Graphs