Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches

DOI10.4230/LIPIcs.FSTTCS.2015.52zbMath1366.68357arXiv1510.03252OpenAlexW2963152997MaRDI QIDQ5278310

Val Tannen, Yang Li, Sanjeev Khanna, Sepehr Assadi

Publication date: 13 July 2017

Full work available at URL: https://arxiv.org/abs/1510.03252

zbMATH Keywords

maximum matchingssmall-space algorithmsvertex sparsifiers

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) General topics in the theory of algorithms (68W01)

This page was built for publication: Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches