Parallel Construction of Perfect Matchings and Hamiltonian Cycles on Dense Graphs.
Elias DahlhausMarek KarpinskiPublished in: Theor. Comput. Sci. (1988)
Keyphrases
- maximum cardinality
- parallel processing
- graph theory
- series parallel
- graph clustering
- graph representation
- graph model
- quasi cliques
- shared memory
- bipartite graph
- graph matching
- knowledge base
- massively parallel
- stereo correspondence
- evolutionary algorithm
- parallel programming
- object recognition
- pattern recognition
- data structure