An extendable stable matching algorithm of a kind of bipartite graph
DOI10.1080/09720529.2016.1187955zbMATH Open1487.68184OpenAlexW2561454982MaRDI QIDQ5069846FDOQ5069846
Authors: Haizheng Yu, Hong Bian 
Publication date: 19 April 2022
Published in: Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/09720529.2016.1187955
Recommendations
- A matching algorithm for regular bipartite graphs
- On the set of stable matchings in a bipartite graph
- Bipartite matching extendable graphs
- scientific article; zbMATH DE number 4066957
- On maximal bipartite matching extendable graphs
- On the stable \(b\)-matching problem in multigraphs
- A perfect matching algorithm for sparse bipartite graphs
- Bipartite matching-extendability of Halin graphs
- An efficient algorithm for the bipartite matching problem
- Solving matching problems efficiently in bipartite graphs
Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)
Cites Work
- College Admissions and the Stability of Marriage
- Stable marriage assignment for unequal sets
- The Economist as Engineer: Game Theory, Experimentation, and Computation as Tools for Design Economics
- Linear programming brings marital bliss
- Characterization of stable matchings as extreme points of a polytope
- Procedurally fair and stable matching
- Beauty and distance in the stable marriage problem
- A number of stable matchings in models of the Gale-Shapley type
- Courtship and linear programming
- Random stable matchings
Cited In (2)
This page was built for publication: An extendable stable matching algorithm of a kind of bipartite graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5069846)
