20 citations · 71 across the 26 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.DS2016
Vertex Sparsification in Trees
Gramoz Goranci, Harald Raecke
Given an unweighted tree with terminals , we show how to obtain a -quality vertex flow and cut sparsifier with . We prove that our result is…
cs.DS2016
Incremental Exact Min-Cut in Poly-logarithmic Amortized Update Time
Gramoz Goranci, Monika Henzinger, Mikkel Thorup
We present a deterministic incremental algorithm for \textit{exactly} maintaining the size of a minimum cut with amortized time per edge insertion and que…
cs.DS2016
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds
Yun Kuen Cheung, Gramoz Goranci, Monika Henzinger
Given a graph where vertices are partitioned into terminals and non-terminals, the goal is to compress the graph (i.e., reduce the number of non-terminals) using minor operatio…