Connectivity and Minimum Cut Approximation in the Broadcast Congested Clique.

Tomasz Jurdzinski Krzysztof Nowicki

Published in: SIROCCO (2018)

Keyphrases

minimum cut
maximum flow
graph cuts
weighted graph
graph partitioning
shortest path
shortest path problem
connected components
min cut
approximation algorithms
normalized cut