A BSP/CGM Algorithm for Computing Euler Tours in Graphs.
Edson CáceresC. Y. NasuPublished in: SBAC-PAD (2003)
Keyphrases
- learning algorithm
- computational cost
- detection algorithm
- k means
- preprocessing
- np hard
- expectation maximization
- graph structure
- experimental evaluation
- computational complexity
- cost function
- adjacency graph
- optimization algorithm
- times faster
- finding the shortest path
- dynamic programming
- hyper graph
- graph construction
- undirected graph
- objective function
- matching algorithm
- clustering method
- segmentation algorithm
- neural network
- graphical models
- significant improvement