An efficient algorithm for the configuration problem of dominance graphs.
Ernst AlthausDenys DuchierAlexander KollerKurt MehlhornJoachim NiehrenSven ThielPublished in: SODA (2001)
Keyphrases
- dynamic programming
- detection algorithm
- computational complexity
- learning algorithm
- preprocessing
- experimental evaluation
- improved algorithm
- computationally efficient
- expectation maximization
- computational cost
- matching algorithm
- optimal solution
- graph model
- optimization algorithm
- theoretical analysis
- graph isomorphism
- particle swarm optimization
- worst case
- k means
- objective function
- simulated annealing
- high accuracy
- np hard
- times faster
- search space
- spanning tree
- minimum spanning tree
- hyper graph