An E log E Line Crossing Algorithm for Levelled Graphs.
Vance E. WaddleAshok MalhotraPublished in: Graph Drawing (1999)
Keyphrases
- computational complexity
- experimental evaluation
- learning algorithm
- computational cost
- matching algorithm
- detection algorithm
- np hard
- cost function
- worst case
- improved algorithm
- preprocessing
- significant improvement
- minimum spanning tree
- computationally efficient
- segmentation algorithm
- optimization algorithm
- optimal solution
- adjacency graph
- graph structure
- graph theory
- clustering method
- np complete
- simulated annealing
- dynamic programming