A layout algorithm for undirected compound graphs.
Ugur DogrusözErhan GiralAhmet CetintasAli CivrilEmek DemirPublished in: Inf. Sci. (2009)
Keyphrases
- detection algorithm
- optimization algorithm
- learning algorithm
- similarity measure
- segmentation algorithm
- dynamic programming
- computational complexity
- objective function
- cost function
- computational cost
- computationally efficient
- undirected graph
- experimental evaluation
- worst case
- high accuracy
- weighted graph
- recognition algorithm
- input data
- matching algorithm
- minimum spanning tree
- graph clustering
- expectation maximization
- linear programming
- simulated annealing
- search space
- preprocessing
- optimal solution