Flip-trees: fault-tolerant graphs with wide containers
- 1 April 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 37 (4) , 472-478
- https://doi.org/10.1109/12.2194
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Fault diameter of interconnection networksComputers & Mathematics with Applications, 1987
- Fault-Tolerant Routing in DeBruijn Comrnunication NetworksIEEE Transactions on Computers, 1985
- Generalized Hypercube and Hyperbus Structures for a Computer NetworkIEEE Transactions on Computers, 1984
- Dense Trivalent Graphs for Processor InterconnectionIEEE Transactions on Computers, 1982
- Graphs as models of communication network vulnerability: Connectivity and persistenceNetworks, 1981
- Multidimensional Binary Search Trees in Database ApplicationsIEEE Transactions on Software Engineering, 1979
- A Graph Model for Fault-Tolerant Computing SystemsIEEE Transactions on Computers, 1976
- A Shuffle-Exchange Network with Simplified ControlIEEE Transactions on Computers, 1976
- Graph Theory with ApplicationsPublished by Springer Nature ,1976
- An Algorithm for Construction of the Least Vulnerable Communication Network or the Graph with the Maximum ConnectivityIEEE Transactions on Circuit Theory, 1969