Proceedings of the IRE · 1960 · 74 citations · 7 references
ComputingDecision SciencesCircuit TheoryComputational GeometryOptimizationGraph AlgorithmsInformation Flow In NetworksNetwork Flow AlgorithmsNetwork FlowsFlow NetworksNetwork Flow Problems
Starting from the definition of a determinant and using a few of its elementary properties, this paper gives an independent derivation of the optimum formula for the gain of a flow graph. Thus, a simpler path is shown to Coates' important result. This paper is self-contained, so that no previous knowledge of flow graphs is required. For motivation, the reader is referred to some well kmown papers and books.
7
Feedback Theory-Further Properties of Signal Flow Graphs
Samuel J. Mason · Proceedings of the IRE · 1956 · 707 citations · Full text
Signal-Flow Graphs and Random Signals
W. H. Huggins · Proceedings of the IRE · 1957 · 75 citations
John E. Maxfield, David K. Cheng · American Mathematical Monthly · 1960 · 66 citations