) time algorithm for computing Reeb graphs of arbitrary simplicial complexes.
William HarveyYusu WangRephael WengerPublished in: SCG (2010)
Keyphrases
- improved algorithm
- computational cost
- learning algorithm
- cost function
- worst case
- optimization algorithm
- computational complexity
- k means
- significant improvement
- times faster
- dynamic programming
- detection algorithm
- adjacency graph
- graph structure
- tree structure
- np hard
- optimal solution
- objective function
- linear programming
- high accuracy
- clustering method
- experimental evaluation
- matching algorithm
- convergence rate
- recognition algorithm
- undirected graph
- neural network