"On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow."

Katerina Altmanová, Petr Kolman, Jan Voborník (2019)

> Home

Details and statistics

DOI: 10.1007/978-3-030-24766-9_2

access: closed

type: Conference or Workshop Paper

metadata version: 2022-12-07

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/wads/AltmanovaKV19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/wads/AltmanovaKV19
Katerina Altmanová, Petr Kolman, Jan Voborník:
On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow. WADS 2019: 14-27

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.