Speeding Up the Gomory-Hu Parallel Cut Tree Algorithm with Efficient Graph Contractions.
Charles MaskeJaime CohenElias P. Duarte Jr.Published in: Algorithmica (2020)
Keyphrases
- learning algorithm
- dynamic programming
- tree structure
- single pass
- computational complexity
- np hard
- graph based algorithm
- expectation maximization
- parallel implementation
- maximum weight
- weighted graph
- minimum spanning tree
- matching algorithm
- detection algorithm
- computationally efficient
- simulated annealing
- k means
- objective function
- tree construction
- maximum flow
- binary tree
- depth first search
- spanning tree
- graph model
- graph structure
- search space
- optimal solution
- minimum cut
- bipartite graph
- shortest path problem
- association rules
- decision trees