5 citations · 9 across the 8 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2017★ 1 cited
Embedded-width: A variant of treewidth for plane graphs
Glencora Borradaile, Jeff Erickson, Hung Le +1
We define a special case of tree decompositions for planar graphs that respect a given embedding of the graph. We study the analogous width of the resulting decomposition we call t…
cs.DM2011★ 1 cited
Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time
Glencora Borradaile, Philip N. Klein, Shay Mozes +2
We give an O(n log^3 n) algorithm that, given an n-node directed planar graph with arc capacities, a set of source nodes, and a set of sink nodes, finds a maximum flow from the sou…