Login / Signup
Space Complexity of Perfect Matching in Bounded Genus Bipartite Graphs.
Samir Datta
Raghav Kulkarni
Raghunath Tewari
N. V. Vinodchandran
Published in:
Electron. Colloquium Comput. Complex. (2010)
Keyphrases
</>
space complexity
bipartite graph
maximum matching
maximum cardinality
bipartite graph matching
maximum weight
worst case
arc consistency
stable set
link prediction
graph clustering
space requirements
bipartite networks
pattern matching
minimum weight
matching algorithm
keypoints
lower bound