Faster Cut Sparsification of Weighted Graphs.

Sebastian Forster Tijn de Vos

Published in: CoRR (2021)

Keyphrases

weighted graph
vertex set
normalized cut
shortest path
regularization framework
planar graphs
graph partitioning
graph structure
edge weights
discrete data
data objects
spanning tree
least squares
data structure
maximum likelihood