25 citations · 78 across the 26 of their papers we have counts for
4 papers · 1 filter
Improving Robustness of Next-Hop Routing
Glencora Borradaile, W. Sean Kennedy, Gordon Wilfong +1
A weakness of next-hop routing is that following a link or router failure there may be no routes between some source-destination pairs, or packets may get stuck in a routing loop a…
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…
Density decompositions of networks
Glencora Borradaile, Theresa Migler, Gordon Wilfong
We introduce a new topological descriptor of a network called the density decomposition which is a partition of the nodes of a network into regions of uniform density. The decompos…
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,…