An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing.
Markus EiglspergerMartin SiebenhallerMichael KaufmannPublished in: J. Graph Algorithms Appl. (2005)
Keyphrases
- parallel implementation
- segmentation algorithm
- computational complexity
- learning algorithm
- k means
- cost function
- dynamic programming
- particle swarm optimization
- worst case
- optimal solution
- objective function
- case study
- detection algorithm
- np hard
- search space
- open source
- simulated annealing
- data processing
- computationally efficient
- hardware implementation
- image processing