Some graph partitioning problems and algorithms related to routing in large computer networks
- 7 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Performance evaluation of a hierarchical hybrid adaptive routing algorithm for large scale computer communication networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Establishing virtual circuits in large computer networksComputer Networks and ISDN Systems, 1986
- SNA Networks of Small SystemsIEEE Journal on Selected Areas in Communications, 1985
- The New Routing Algorithm for the ARPANETIEEE Transactions on Communications, 1980
- A Review of the Development and Performance of the ARPANET Routing AlgorithmIEEE Transactions on Communications, 1978
- A Linear Tree Partitioning AlgorithmSIAM Journal on Computing, 1977
- Hierarchical routing for large networks Performance evaluation and optimizationComputer Networks (1976), 1977
- Efficient Algorithm for the Partitioning of TreesIBM Journal of Research and Development, 1974
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970
- Module Clustering to Minimize Delay in Digital NetworksIEEE Transactions on Computers, 1969