The Demand Query Model for Bipartite Matching

CoRR, 2019.

Cited by: 0|Bibtex|Views6
EI
Other Links: dblp.uni-trier.de|arxiv.org

Abstract:

We introduce a `concrete complexity' model for studying algorithms for matching in bipartite graphs. The model is based on the "demand query" model used for combinatorial auctions. Most (but not all) known algorithms for bipartite matching seem to be translatable into this model including exact, approximate, sequential, parallel, and on...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments