A practical algorithm for making filled graphs minimal.
Jean R. S. BlairPinar HeggernesJan Arne TellePublished in: Theor. Comput. Sci. (2001)
Keyphrases
- learning algorithm
- optimization algorithm
- improved algorithm
- experimental evaluation
- computational cost
- objective function
- computational complexity
- optimal solution
- dynamic programming
- real world
- k means
- search space
- graph isomorphism
- graph structure
- detection algorithm
- simulated annealing
- expectation maximization
- high accuracy
- preprocessing
- similarity measure
- particle filter
- theoretical analysis
- input data
- data sets
- convergence rate
- graph theory
- weighted graph
- minimum spanning tree
- finding the shortest path