Matching problem of electronic broker based on stable bipartite matching
Explore this paper's citation graph
Summary
The concept of stable bipartite matching is introduced, and the algorithm of solving 1-1 and 1-k stable matching problem using Gale-Sharply and H-R(hospital-resident) algorithm is summarized.
- Type
- article
- Published
- 2008-01-01
- Cited by
- 2
- References
- 0
- OpenAlex
- https://openalex.org/W2362975861
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:123816045
Keywords
Bipartite graph, Matching (statistics), Blossom algorithm, Stability (learning theory), Rank (graph theory)
References
No references recorded for this paper.
Cited by
Related papers
- Constructing an algorithm of quadratic time complexity for finding the maximal matching
- Fully Online Matching II: Beating Ranking and Water-filling
- A Subquadratic-Time Distributed Algorithm for Exact Maximum Matching
- Diversified Top-k Graph Pattern Matching
- Online Algorithms for Maximum Cardinality Matching with Edge Arrivals