A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs.
Marta R. HidalgoRobert Joan-ArinyoPublished in: J. Symb. Comput. (2017)
Keyphrases
- tree structure
- search space
- np hard
- learning algorithm
- spanning tree
- preprocessing
- matching algorithm
- cost function
- detection algorithm
- optimal solution
- computational complexity
- k means
- worst case
- segmentation algorithm
- computational cost
- minimum spanning tree
- simulated annealing
- tree construction
- particle swarm optimization
- unordered trees
- undirected graph
- polynomial time complexity
- graph model
- graph structure
- np complete
- dynamic programming
- significant improvement
- objective function