An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs

This is a publication. If there is no link to the publication on this page, you can try the pre-formated search via the search engines listed on this page.

Authors: Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz

Journal title: Algorithmica

Journal publisher: Springer Verlag

Published year: 2018

DOI identifier: 10.1007/s00453-018-0504-8

ISSN: 0178-4617