3d local algorithm for dominating sets of unit disk graphs.
Alaa Eddien AbdallahThomas FevensJaroslav OpatrnyPublished in: CCCG (2010)
Keyphrases
- times faster
- dynamic programming
- detection algorithm
- preprocessing
- worst case
- k means
- significant improvement
- cost function
- computational cost
- theoretical analysis
- learning algorithm
- graph isomorphism
- graph clustering
- graph structure
- matching algorithm
- high accuracy
- experimental evaluation
- search space
- optimal solution
- objective function
- neural network
- linear programming
- particle swarm optimization
- segmentation algorithm
- probabilistic model
- clustering method
- directed graph
- graph matching
- recognition algorithm
- graph model
- minimum spanning tree