Space complexity of perfect matching in bounded genus bipartite graphs.
Samir DattaRaghav KulkarniRaghunath TewariN. V. VinodchandranPublished in: J. Comput. Syst. Sci. (2012)
Keyphrases
- space complexity
- bipartite graph
- maximum matching
- maximum cardinality
- bipartite graph matching
- maximum weight
- worst case
- stable set
- arc consistency
- minimum weight
- space requirements
- graph clustering
- matching algorithm
- link prediction
- worst case time complexity
- keypoints
- pattern matching
- edge weights
- endpoints
- data sets
- shape matching
- graph matching
- constraint programming
- data structure
- information retrieval
- machine learning