Login / Signup
A survey on self-stabilizing algorithms for independence, domination, coloring, and matching in graphs.
Nabil Guellati
Hamamache Kheddouci
Published in:
J. Parallel Distributed Comput. (2010)
Keyphrases
</>
orders of magnitude
graph theory
learning algorithm
computational cost
graph matching
worst case
computationally efficient
theoretical analysis
social networks
computer vision
evolutionary algorithm
graph theoretic
object matching
graph matching algorithm
maximum cardinality