Publications with Christian Wulff-Nilsen
- All-pairs minimum cuts in near-linear time for surface-embedded graphs.
G. Borradaile, D. Eppstein, A. Nayyeri, and C. Wulff-Nilsen.
arXiv:1411.7055.
Proc. 32nd Int. Symp. Computational Geometry, Boston, 2016.
Leibniz International Proceedings in Informatics (LIPIcs) 51, pp. 22:1–22:16.
We give the first known near-linear algorithms for constructing Gomory–Hu trees of bounded-genus graphs, and we shave a log off the time for the same problem on planar graphs.