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

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

> Home

Details and statistics

DOI: 10.7155/JGAA.00534

access: open

type: Journal Article

metadata version: 2022-12-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jgaa/AltmanovaKV20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgaa/AltmanovaKV20
Katerina Altmanová, Petr Kolman, Jan Voborník:
On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow. J. Graph Algorithms Appl. 24(3): 303-322 (2020)

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.