A distributed polylogarithmic time algorithm for self-stabilizing skip graphs.
Riko JacobAndréa W. RichaChristian ScheidelerStefan SchmidHanjo TäubigPublished in: PODC (2009)
Keyphrases
- learning algorithm
- experimental evaluation
- preprocessing
- recognition algorithm
- times faster
- search space
- theoretical analysis
- distributed systems
- high accuracy
- worst case
- probabilistic model
- objective function
- matching algorithm
- np hard
- computational cost
- dynamic programming
- cost function
- k means
- computational complexity
- optimal solution
- graph structure
- minimum spanning tree
- lower complexity
- graph isomorphism