A Theorem on Flow in Directed Graphs

DOI10.1112/JLMS/S2-19.1.187MaRDI QIDQ4175307zbMATH OpenOpenAlexFDO

Authors Philippe Artzner, Richard Rado

Publication date 1979

Published in Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/jlms/s2-19.1.187

zbMATH Keywords

Markov ChainsDirected PathEquivalence ClassesFinal StatesFlow in Directed GraphsPartitioned

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Cited in

(1)

• Max-flow min-cut theorem for directed fuzzy incidence networks

This page was built for publication: A Theorem on Flow in Directed Graphs

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