Achieving Optimal Inter-Node Communication in Graph Partitioning Using Random Selection and Breadth-First Search.
Srimanth GaddeWilliam F. AcostaJordan RingenbergRobert GreenVijay K. DevabhaktuniPublished in: Int. J. Parallel Program. (2016)
Keyphrases
- graph partitioning
- breadth first search
- random selection
- heuristic function
- depth first search
- weighted graph
- graph model
- randomly selected
- image segmentation
- test set
- clustering algorithm
- data clustering
- search algorithm
- spectral clustering
- graph structure
- tree structure
- training set
- feature extraction
- data sets
- text classification
- multi class
- k means
- multiscale
- face recognition