Synthesis of Radio-Communication Nets
- 1 March 1962
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IRE Transactions on Circuit Theory
- Vol. 9 (1) , 62-68
- https://doi.org/10.1109/TCT.1962.1086861
Abstract
A radio-communication net is a communication network in which links between stations have unlimited capacity to transmit information. Such a network can be represented by a graph with weights on the vertices which correspond to the capacities of individual stations. The capacity of a radio-communication net ofnstations is described by a matrix of orderncalled a terminalcapacity matrix. A necessary and sufficient condition for a matrix to be realizable as the terminal-capacity matrix of a radio-communication net is found. A simple algorithm for synthesizing a radio-communication net of a given terminal-capacity matrix, which is proved to have minimum sum of vertex capacities and minimum number of branches, is obtained. A theorem concerning all possible structures of a radio-communication net with the same terminal-capacity matrix is established.Keywords
This publication has 10 references indexed in Scilit:
- Planar GraphsPublished by Springer Nature ,1992
- Optimal Synthesis of a Communication NetIRE Transactions on Circuit Theory, 1961
- Analysis and Synthesis Techniques of Oriented Communication NetsIRE Transactions on Circuit Theory, 1961
- Graphs with two kinds of elementsJournal of the Franklin Institute, 1960
- Terminal and Branch Capacity Matrices of a Communication NetIRE Transactions on Circuit Theory, 1960
- Synthesis of a Communication NetIBM Journal of Research and Development, 1960
- The Path Matrix and its RealizabilityIRE Transactions on Circuit Theory, 1959
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock ProblemCanadian Journal of Mathematics, 1957
- A note on the maximum flow through a networkIEEE Transactions on Information Theory, 1956
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956