An extendable stable matching algorithm of a kind of bipartite graph

DOI10.1080/09720529.2016.1187955zbMath1487.68184OpenAlexW2561454982MaRDI QIDQ5069846

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

zbMATH Keywords

college admission problemextensive matchingstable alternated pathstable extensive matching

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)

Related Items (1)

Generalization of bipartite graphs

Cites Work

• Linear programming brings marital bliss
• Characterization of stable matchings as extreme points of a polytope
• Courtship and linear programming
• A number of stable matchings in models of the Gale-Shapley type
• Procedurally fair and stable matching
• Random stable matchings
• The Economist as Engineer: Game Theory, Experimentation, and Computation as Tools for Design Economics
• Stable marriage assignment for unequal sets
• College Admissions and the Stability of Marriage
• Beauty and distance in the stable marriage problem

This page was built for publication: An extendable stable matching algorithm of a kind of bipartite graph