Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs.
Marco Aurelio StefanesDiego P. RubertJosé SoaresPublished in: Theor. Comput. Sci. (2020)
Keyphrases
- parallel algorithm
- maximum matching
- bipartite graph
- parallel computation
- stable set
- parallel programming
- minimum weight
- combinatorial search problems
- cluster of workstations
- shared memory
- parallel implementations
- pc cluster
- maximum cardinality
- link prediction
- memory efficient
- interconnection networks
- machine learning
- scheduling problem
- active learning
- training set
- search engine