Faster Cut Sparsification of Weighted Graphs.

Sebastian Forster Tijn de Vos

Published in: ICALP (2022)

Keyphrases

weighted graph
vertex set
normalized cut
shortest path
graph partitioning
planar graphs
regularization framework
graph structure
discrete data
data objects
high level
least squares
graph connectivity