2 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.DM2011★ 1 cited
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications
Christian Wulff-Nilsen
Alon, Seymour, and Thomas generalized Lipton and Tarjan's planar separator theorem and showed that a -minor free graph with vertices has a separator of size at most $h^{3/…
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…
cs.DM2009★ 2 cited
Girth of a Planar Digraph with Real Edge Weights in O(n(log n)^3) Time
Christian Wulff-Nilsen
The girth of a graph is the length of its shortest cycle. We give an algorithm that computes in O(n(log n)^3) time and O(n) space the (weighted) girth of an n-vertex planar digraph…