An O(m) Algorithm for Cores Decomposition of Networks
Vladimir BatageljMatjaz ZaversnikPublished in: CoRR (2003)
Keyphrases
- detection algorithm
- theoretical analysis
- learning algorithm
- optimal solution
- preprocessing
- cost function
- dynamic programming
- improved algorithm
- experimental evaluation
- k means
- parallel implementation
- significant improvement
- search space
- computational complexity
- objective function
- computational cost
- data sets
- worst case
- times faster
- matching algorithm
- decomposition algorithm
- probabilistic model
- convex hull
- network structure
- tree structure
- computationally efficient
- expectation maximization
- particle swarm optimization
- motion estimation
- mobile robot
- feature selection
- genetic algorithm