
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
F.J. Meyer, "FlipTrees: FaultTolerant Graphs with Wide Containers," IEEE Transactions on Computers, vol. 37, no. 4, pp. 472478, April, 1988.  
BibTex  x  
@article{ 10.1109/12.2194, author = {F.J. Meyer}, title = {FlipTrees: FaultTolerant Graphs with Wide Containers}, journal ={IEEE Transactions on Computers}, volume = {37}, number = {4}, issn = {00189340}, year = {1988}, pages = {472478}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.2194}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  FlipTrees: FaultTolerant Graphs with Wide Containers IS  4 SN  00189340 SP472 EP478 EPD  472478 A1  F.J. Meyer, PY  1988 KW  computer networks; flip trees; graphs; positive integer; container; nodedisjoint paths; faulttolerant diameter; ease of routing; faulttolerant routing; computer networks; fault tolerant computing; graph theory; trees (mathematics). VL  37 JA  IEEE Transactions on Computers ER   
[1] S. B. Akers and B. Krishnamurthy, "Group graphs as interconnection networks," inProc. 14th Int. Symp. FaultTolerant Comput., Orlando, FL, June 1984, pp. 422427.
[2] S. B. Akers and B. Krishnamurthy, "Faulttolerance in star graphs," inProc. 1987 Int. Conf. Supercomput., San Francisco, CA, May 1987.
[3] J. L. Bentley and H. T. Kung, "A tree machine for searching problems," inProc. 1979 Int. Conf. Parallel Processing, Detroit, MI, Aug. 1979, pp. 257266.
[4] L. N. Bhuyan and D. P. Agrawal, "Generalized hypercube and hyperbus structures for computer networks,"IEEE Trans. Comput., vol. C33, pp. 323333, Apr. 1984.
[5] F. T. Boesch, F. Harary, and J. H. Kabell, "Graphs as models of communication network vulnerability: Connectivity and persistence,"Networks, vol. 11, pp. 5763, 1981.
[6] J. Bondy and U. Murthy,Graph Theory with Applications. New York: American Elsevier, 1976.
[7] Davies, D. W. 1972. The control of congestion in packetswitching networks.IEEE Trans. on Communications COM20, pp. 546550.
[8] C. Delorme and G. Farhi, "Large graphs with given degree and diameterPart I,"IEEE Trans. Comput., vol. C33, pp. 857860, Sept. 1984.
[9] D. Dolev, "The Byzantine generals strike again,"Algorithms, vol. 3, pp. 1430, 1982.
[10] A.H. Esfahanian and S. L. Hakimi, "Faulttolerant routing in de Bruijn communications networks,"IEEE Trans. Comput., vol. C34, pp. 777788, Sept. 1985.
[11] L. R. Ford, Jr. and D. R. Fulkerson,Flows in Networks. Princeton, NJ: Princeton Univ. Press, 1962.
[12] S. L. Hakimi, "An algorithm for construction of the least vulnerable communication network or the graph with the maximum connectivity,"IEEE Trans. Circuit Theory., vol. CT16, pp. 229230, May 1969.
[13] J. P. Hayes, "A graph model for faulttolerant computing systems,"IEEE Trans. Comput., vol. C25, pp. 875884, Sept. 1976.
[14] M. S. Krishnamoorthy and B. Krishnamurthy, "Fault diameter of interconnection networks,"Comput. Math. Appl., vol. 13, no. 5/6, pp. 577582, 1987.
[15] V. P. Kumar and S. M. Reddy, "A class of graphs for faulttolerant processor interconnections," inProc. 4th Int. Conf. Distributed Comput. Syst., San Francisco, CA, May 1984, pp. 448460.
[16] T. Lang and H. S. Stone, "A shuffleexchange network with simplified control,"IEEE Trans. Comput., vol. C25, pp. 5566, Jan. 1976.
[17] W. E. Leland, "Dense interconnection graphs with small degree," Ph.D. dissertation, Dep. Comput. Sci., Univ. Wisconsin, Madison, WI, Aug. 1981.
[18] W. E. Leland and M. H. Solomon, "Dense trivalent graphs for processor interconnection,"IEEE Trans. Comput., vol. C31, pp. 219222, Mar. 1982.
[19] F. J. Meyer and D. K. Pradhan, "Consensus with dual failure modes," Tech. Rep., Dep. Elec. Comput. Eng., Univ. Massachusetts, Amherst, MA, Apr. 1987.
[20] F. J. Meyer and D. K. Pradhan, "Fliptrees: Graphs with wide containers," Tech. Rep., Dep. Elec. Comput. Eng., Univ. Massachusetts, Amherst, MA, Nov. 1987.
[21] E. F. Moore, "The shortest path through a maze," inProc. Int. Symp. Switching Theory, 1957, Part II. Cambridge, MA: Harvard Univ. Press, 1959, pp. 285292.
[22] D. K. Pradhan, "Faulttolerant multiprocessor link and bus network architectures,"IEEE Trans. Comput., vol. C34, pp. 3345, Jan. 1985.
[23] D. K. Pradhan and S. M. Reddy, "A faulttolerant communication architecture for distributed systems,"IEEE Trans. Comput., vol. C 31, pp. 863870, Sept. 1982.
[24] F. P. Preparata and J. Vuillemin, "The cubeconnected cycle: A versatile network for parallel computation,"Commun. ACM, vol. 24, pp. 300309, May 1981.
[25] A. Rucinski and J. L. Pokoski, "Polystructural, reconfigurable, and faulttolerant computers," inProc. 6th Int. Conf. Distributed Comput. Syst., Cambridge, MA, May 1986, pp. 175182.
[26] A. Sengupta, A. Sen, and S. Bandyopadhyay, "On an optimally fault tolerant multiprocessor network architecture,"IEEE Trans. Comput., vol. C36, pp. 619623, May 1987.
[27] S. Toida, F. J. Meyer, and D. K. Pradhan, "A theorem on the faulttolerance of a modified de Bruijn network topology,"IEEE Trans. Comput., submitted for publication.
[28] D. K. Pradhan,Fault Tolerant Computing: Theory and Techniques. Englewood Cliffs, NJ: PrenticeHall, 1986.