Algorithm model research of the logical cutting tree on the network maximum flow

DOI10.1108/03684920410514184MaRDI QIDQ4828575zbMATH OpenOpenAlexFDO

Authors Zhigeng Fang, Sifeng Liu, Bao-guang Xu

Publication date 23 November 2004

Published in Kybernetes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1108/03684920410514184

zbMATH Keywords

CyberneticsFlow measurementNetwork operating systems

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 988194
• Algorithms for maximum network flow
• scientific article; zbMATH DE number 5371757
• A dual graph algorithm model and its implementation of the maximum flow on the large-scale networks
• scientific article; zbMATH DE number 1022488

Cited in

(2)

• A new model \(K*TDG\) for complex data flow polynomial and its search algorithm
• A dual graph algorithm model and its implementation of the maximum flow on the large-scale networks

This page was built for publication: Algorithm model research of the logical cutting tree on the network maximum flow

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4828575)