An Efficient Implementation of Sugiyama's Algorithm for Layered Graph Drawing.
Markus EiglspergerMartin SiebenhallerMichael KaufmannPublished in: Graph Drawing (2004)
Keyphrases
- detection algorithm
- computational complexity
- learning algorithm
- preprocessing
- probabilistic model
- optimal solution
- cost function
- parallel implementation
- dynamic programming
- np hard
- k means
- objective function
- data analysis
- similarity measure
- knowledge base
- worst case
- simulated annealing
- computationally efficient
- segmentation algorithm
- information retrieval
- hardware implementation
- machine learning