An Algorithm for Drawing Compound Graphs.
François BertaultMirka MillerPublished in: Graph Drawing (1999)
Keyphrases
- high accuracy
- learning algorithm
- expectation maximization
- computational cost
- input data
- times faster
- detection algorithm
- experimental evaluation
- dynamic programming
- cost function
- np hard
- optimal solution
- graph construction
- preprocessing
- computational complexity
- clustering method
- graph isomorphism
- minimum spanning tree
- undirected graph
- spanning tree
- graph structure
- convergence rate
- clustering algorithm
- optimization algorithm
- segmentation algorithm
- particle swarm optimization
- neural network
- simulated annealing
- worst case
- k means