scientific article; zbMATH DE number 6501391

DOI10.3969/J.ISSN.1001-0505.2015.02.008MaRDI QIDQ3195889zbMATH OpenFDO

Authors Baili Zhang, Juan Yang, Jianhua Lu, Wei Tian

Publication date 28 October 2015

Full work available at URL https://doi.org/10.3969/J.ISSN.1001-0505.2015.02.008

zbMATH Keywords

flow reliabilitymaximum flowminimum cutuncertain graph

Mathematics Subject Classification ID

Flows in graphs (05C21) Fractional graph theory, fuzzy graph theory (05C72) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• The maximum flow problem of uncertain network
• scientific article; zbMATH DE number 2186021
• Uncertain graph and network optimization
• Approximate maximum flow on separable undirected graphs
• On robust maximum flow with polyhedral uncertainty sets
• An algorithm of calculating the reliability of stochastic flow networks by using minimal cuts
• The minimum cost flow problem of uncertain random network
• Uniformly optimally reliable graphs: A survey
• Maximum flows in probabilistic networks

This page was built for publication:

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