Embedding Algorithm Between the Macro-star Graph and the Matrixstar Graph.
Jeong-Suk KimJungHyun SeoHyun SimHyeong-Ok LeePublished in: PDPTA (2006)
Keyphrases
- graph based algorithm
- graph structure
- shortest path problem
- graph model
- dynamic programming
- graph theoretical
- maximum flow
- undirected graph
- weighted graph
- learning algorithm
- graph construction
- preprocessing
- minimum spanning tree
- matching algorithm
- finding the shortest path
- graph representation
- detection algorithm
- optimal solution
- dominating set
- adjacency graph
- graph search
- k means
- random graphs
- computational complexity
- bayesian networks
- polynomial time complexity
- spectral embedding
- breadth first search
- directed graph
- graph clustering
- search space
- random walk
- segmentation algorithm
- directed acyclic graph
- tree structure
- connected components
- graph theory
- graph matching
- graph embedding
- search algorithm
- graph partitioning
- objective function
- solution path
- graph connectivity