An improved force-directed graph layout algorithm based on aesthetic criteria.
Wenqiang DongXingyu FuGuangluan XuYu HuangPublished in: Comput. Vis. Sci. (2013)
Keyphrases
- directed graph
- learning algorithm
- computational cost
- shortest path problem
- worst case
- computational complexity
- preprocessing
- cost function
- dynamic programming
- optimization algorithm
- probabilistic model
- search space
- optimal solution
- k means
- particle swarm optimization
- expectation maximization
- detection algorithm
- neural network
- np hard
- objective function
- similarity measure
- maximum flow