Self-Stabilizing Algorithms for Maximal 2-packing and General k-packing (k ≥ 2) with Safe Convergence in an Arbitrary Graph.
Yihua DingJames Zijun WangPradip K. SrimaniPublished in: Int. J. Netw. Comput. (2015)
Keyphrases
- graph theory
- theoretical justification
- convergence property
- data structure
- markov random field
- previously studied
- packing problem
- learning algorithm
- graph matching
- iterative algorithms
- minimum spanning tree
- graph representation
- graph structure
- convergence rate
- random walk
- special case
- significant improvement
- image segmentation
- decision trees