Rank degree: An efficient algorithm for graph sampling.
Elli VoudigariNikos SalamanosTheodore PapageorgiouEmmanuel J. YannakoudakisPublished in: ASONAM (2016)
Keyphrases
- objective function
- graph based algorithm
- cost function
- preprocessing
- k means
- dynamic programming
- convergence rate
- worst case
- np hard
- computational complexity
- learning algorithm
- dominating set
- random graphs
- minimum spanning tree
- graph structure
- monte carlo
- clustering method
- detection algorithm
- optimization algorithm
- expectation maximization
- simulated annealing
- segmentation algorithm
- tree structure
- computationally efficient
- matching algorithm
- parameter space
- particle swarm optimization
- graph model
- spanning tree
- graph partitioning
- computational cost
- maximum flow
- search space
- optimal solution