Inverting and Minimalizing Path Sets and Cut Sets

DOI10.1109/TR.1978.5220270zbMath0383.05025MaRDI QIDQ4163555

Mitchell O. Locks

Publication date: 1978

Published in: IEEE Transactions on Reliability (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items

Parametric max flow problems in a class of networks with series-parallel structure, A simple algorithm to search for all MCs in networks