An extendable stable matching algorithm of a kind of bipartite graph

DOI10.1080/09720529.2016.1187955MaRDI QIDQ5069846zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

college admission problemextensive matchingstable alternated pathstable extensive matching

Mathematics Subject Classification ID

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)

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

Cites work

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

Cited in

(2)

• A self-stabilizing algorithm for \(b\)-matching
• Generalization of bipartite graphs

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)