6 citations · 16 across the 18 of their papers we have counts for
Showing 2017 · cs.DSShow all
2 papers · 2 filters
cs.DS2017★ 6 cited
The Power of Vertex Sparsifiers in Dynamic Graph Algorithms
Gramoz Goranci, Monika Henzinger, Pan Peng
We introduce a new algorithmic framework for designing dynamic graph algorithms in minor-free graphs, by exploiting the structure of such graphs and a tool called vertex sparsifica…
cs.DS2017
Improved Guarantees for Vertex Sparsification in Planar Graphs
Gramoz Goranci, Monika Henzinger, Pan Peng
Graph Sparsification aims at compressing large graphs into smaller ones while preserving important characteristics of the input graph. In this work we study Vertex Sparsifiers, i.e…