A Matching Based Automata for Distributed Graph Algorithms.
J. Paul DaigleSushil K. PrasadPublished in: IPDPS Workshops (2011)
Keyphrases
- graph matching
- graph theory
- learning algorithm
- computational complexity
- computational cost
- random graphs
- pattern matching
- maximum weight
- maximum flow
- directed graph
- maximum cardinality
- strongly connected
- minimum spanning tree
- matching process
- image matching
- computationally efficient
- itemsets
- markov chain
- worst case
- data structure