A Near-optimal Algorithm for Edge Connectivity-based Hierarchical Graph Decomposition.
Lijun ChangPublished in: CoRR (2017)
Keyphrases
- objective function
- graph based algorithm
- computational complexity
- cost function
- np hard
- dynamic programming
- optimization algorithm
- learning algorithm
- graph connectivity
- decomposition algorithm
- undirected graph
- spanning tree
- weighted graph
- connected components
- particle swarm optimization
- detection algorithm
- matching algorithm
- computational cost
- k means
- preprocessing
- random walk
- multiscale
- minimum spanning tree
- similarity measure
- maximum flow
- clustering algorithm
- adjacency graph
- dominating set
- genetic algorithm