简单(哲学)
图形
数学
流量(数学)
路径(计算)
控制流程图
组合数学
离散数学
计算机科学
几何学
认识论
哲学
程序设计语言
出处
期刊:Proceedings of the IRE
[Institute of Electrical and Electronics Engineers]
日期:1960-05-01
卷期号:48 (5): 883-889
被引量:68
标识
DOI:10.1109/jrproc.1960.287625
摘要
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI