Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs.
Samir DattaRaghav KulkarniRaghunath TewariN. Variyam VinodchandranPublished in: STACS (2011)
Keyphrases
- space complexity
- bipartite graph
- maximum matching
- maximum cardinality
- bipartite graph matching
- maximum weight
- arc consistency
- link prediction
- minimum weight
- matching algorithm
- worst case
- stable set
- social networks
- worst case time complexity
- graph matching
- space requirements
- shape matching
- pattern matching
- constraint satisfaction problems
- information retrieval systems
- special case