Connectivity considerations in the design of survivable networks
- 1 January 1970
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 17 (4) , 486-490
- https://doi.org/10.1109/tct.1970.1083185
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- The Design of Minimum-Cost Survivable NetworksIEEE Transactions on Circuit Theory, 1969
- An Algorithm for Construction of the Least Vulnerable Communication Network or the Graph with the Maximum ConnectivityIEEE Transactions on Circuit Theory, 1969
- Flow variation in multiple min-cut calculationsJournal of the Franklin Institute, 1969
- On the Smallest Disconnecting Set in a GraphIEEE Transactions on Circuit Theory, 1968
- An Algorithm for Vertex-pair ConnectivityInternational Journal of Control, 1967
- Vulnerability of Communication NetworksIEEE Transactions on Communications, 1967
- Topological Analysis and Synthesis of Communication NetworksPublished by Columbia University Press ,1962
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. IJournal of the Society for Industrial and Applied Mathematics, 1962
- THE MAXIMUM CONNECTIVITY OF A GRAPHProceedings of the National Academy of Sciences, 1962