Diverse pairs of matchings

DOI10.1007/s00453-024-01214-7MaRDI QIDQ6547215

Danil Sagunov, Fedor V. Fomin, Lars Jaffke, Petr A. Golovach, Geevarghese Philip

Publication date: 30 May 2024

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

bipartite matchingfixed-parameter tractabilitysolution diversitymaching

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On representatives of subsets.
• 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
• Handbook of Computational Social Choice
• Paths, Trees, and Flowers
• Parameterized Algorithms
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• A Short Proof of the Factor Theorem for Finite Graphs
• On an estimate of the chromatic class of a \(p\)-graph

This page was built for publication: Diverse pairs of matchings