The self-avoiding walk-jump (SAWJ) algorithm for finding maximum degree nodes in large graphs.
Jonathan StokesSteven WeberPublished in: IEEE BigData (2016)
Keyphrases
- graph structure
- random graphs
- learning algorithm
- np hard
- detection algorithm
- probabilistic model
- objective function
- fully connected
- worst case
- dynamic programming
- segmentation algorithm
- tree structure
- matching algorithm
- cost function
- spanning tree
- optimal solution
- community detection algorithms
- maximum clique
- optimization algorithm
- k means