"An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs."

Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz (2019)

> Home

Details and statistics

DOI: 10.1007/S00453-018-0504-8

access: open

type: Journal Article

metadata version: 2023-08-28

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/KarpovPZ19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/KarpovPZ19
Nikolai Karpov, Marcin Pilipczuk, Anna Zych-Pawlewicz:
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs. Algorithmica 81(10): 4029-4042 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.