z-logo
open-access-imgOpen Access
On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow
Author(s) -
Steven Chaplick,
Thomas C. van Dijk,
Myroslav Kryven,
Jiwon Park,
Alexander Ravsky,
Alexander Wolff
Publication year - 2020
Publication title -
journal of graph algorithms and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.387
H-Index - 38
ISSN - 1526-1719
DOI - 10.7155/jgaa.00534
Subject(s) - bounded function , maximum flow problem , combinatorics , mathematics , flow (mathematics) , time complexity , approximation algorithm , polynomial , graph , discrete mathematics , geometry , mathematical analysis

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom