An algorithm for hierarchical reduction and decomposition of a directed graph.
Jochen SchwarzePublished in: Computing (1980)
Keyphrases
- directed graph
- learning algorithm
- preprocessing
- cost function
- dynamic programming
- np hard
- shortest path problem
- optimal solution
- graph structure
- particle swarm optimization
- expectation maximization
- pattern mining
- markov chain
- hierarchical clustering
- undirected graph
- wavelet packet
- hierarchical decomposition
- matching algorithm
- segmentation algorithm
- random walk
- worst case
- lower bound
- computational complexity
- similarity measure
- social networks