z-logo
open-access-imgOpen Access
Finding the Maximum Flow in a Network with Simple Paths
Author(s) -
Seungmin Lee,
Chong-Hyung Lee,
DongHo Park
Publication year - 2002
Publication title -
communications for statistical applications and methods
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.326
H-Index - 6
eISSN - 2383-4757
pISSN - 2287-7843
DOI - 10.5351/ckss.2002.9.3.845
Subject(s) - simple (philosophy) , correctness , process (computing) , algorithm , path (computing) , computer science , flow (mathematics) , mathematical optimization , mathematics , flow network , maximum flow problem , philosophy , geometry , epistemology , programming language , operating system

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