The graphs of stably matchable pairs
From MaRDI portal
Publication:2672447
DOI10.1007/978-3-030-86838-3_27OpenAlexW3203018884MaRDI QIDQ2672447
Publication date: 8 June 2022
Full work available at URL: https://arxiv.org/abs/2010.09230
Cites Work
- Unnamed Item
- Unnamed Item
- Finding all maximally-matchable edges in a bipartite graph
- Semi-nice tree-decompositions: the best of branchwidth, treewidth and pathwidth with one algorithm
- The maximum number of perfect matchings in graphs with a given degree sequence
- Every finite distributive lattice is a set of stable matchings for a small stable marriage instance
- A $c^k n$ 5-Approximation Algorithm for Treewidth
- On the Number of Fixed Pairs in a Random Instance of the Stable Marriage Problem
- The Complexity of Counting Stable Marriages
- The Effect of Planarization on Width
- A simply exponential upper bound on the maximum number of stable matchings
- Algorithmics of Matching Under Preferences
- Stable marriage assignment for unequal sets
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Stable husbands
- College Admissions and the Stability of Marriage
This page was built for publication: The graphs of stably matchable pairs
