Disjoint stable matchings in linear time
From MaRDI portal
Publication:2672428
DOI10.1007/978-3-030-86838-3_7OpenAlexW3201912560MaRDI QIDQ2672428
Prajakta Nimbhorkar, H. V. Vishwa Prakash, Aadityan Ganesh, Geevarghese Philip
Publication date: 8 June 2022
Full work available at URL: https://arxiv.org/abs/2011.13248
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On edge-disjoint pairs of matchings
- Neighborhood conditions and edge-disjoint perfect matchings
- The Geometry of Fractional Stable Matchings and Its Applications
- The Average Number of Stable Matchings
- On the Likely Number of Solutions for the Stable Marriage Problem
- The Complexity of Counting Stable Marriages
- The NP-Completeness of Edge-Coloring
- The number of disjoint perfect matchings in semi-regular graphs
- A simply exponential upper bound on the maximum number of stable matchings
- A Short Proof of the Factor Theorem for Finite Graphs
- College Admissions and the Stability of Marriage
