25 citations · 78 across the 26 of their papers we have counts for
Showing 2014 · cs.CGShow all
2 papers · 2 filters
cs.CG2014
All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs
Glencora Borradaile, David Eppstein, Amir Nayyeri +1
For an undirected -vertex graph with non-negative edge-weights, we consider the following type of query: given two vertices and in , what is the weight of a minim…
cs.CG2014
Covering nearly surface-embedded graphs with a fixed number of balls
Glencora Borradaile, Erin Wolf Chambers
A recent result of Chepoi, Estellon and Vaxes [DCG '07] states that any planar graph of diameter at most 2R can be covered by a constant number of balls of size R; put another way,…