A divide-and-conquer algorithm for the automatic layout of large directed graphs.
Eli MessingerLawrence A. RoweRobert R. HenryPublished in: IEEE Trans. Syst. Man Cybern. (1991)
Keyphrases
- directed graph
- objective function
- experimental evaluation
- high accuracy
- detection algorithm
- preprocessing
- k means
- learning algorithm
- cost function
- computational cost
- computational complexity
- theoretical analysis
- input data
- tree structure
- recognition algorithm
- improved algorithm
- undirected graph
- expectation maximization
- dynamic programming
- significant improvement
- image segmentation
- random walk
- gray scale
- worst case
- matching algorithm
- times faster
- convergence rate
- optimal solution