New graph decompositions and fast emulations in hypercubes and butterflies

Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1993

Volumn , Issue , 1993, Pages 325-334

  Kaklamanis, Christos ^a   Krizanc, Danny ^b   Rao, Satish ^c  

^a RUTGERS UNIVERSITY   (United States)

^b CARLETON UNIVERSITY   (Canada)

^c NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY; NETWORK ARCHITECTURE; PARALLEL ALGORITHMS; PARALLEL ARCHITECTURES;

BOUNDED DEGREE; BOUNDED DEGREE GRAPHS; BUTTERFLY NETWORKS; GRAPH DECOMPOSITIONS; GRAPH SEPARATORS; HYPER-CUBES; PLANAR NETWORKS;

GRAPH THEORY;

EID: 0010902117     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/165231.166112     Document Type: Conference Paper

References (24)

1. A. Agrawal, P. Klein, S. Rao, and R. Ravi. Approximation through multicommodity flow. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, pages 726-737, October 1989.
2. W. Aiello and T. Leighton. Coding theory, hypercube embeddings, and fault tolerance. In Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 125-136, July 1991.
3. N. Alon, P. Seymour, and Thomas R. A separator theorem for graphs with an excluded minor and its applications. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 293-299, May 1990.
4. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Fast constructions of sparse neighborhood covers. Unpublished Manuscript.
5. B. Awerbuch and D. Peleg. Sparse partitions. In 31st Symposium on Foundations of Computer Science, pages 503-513, 1990.
6. V. E. Beneš. Optimal rearrangeable multistage connecting networks. Bell System Technical Journal, 43:1641-1656, July 1964.
7. S. Bhatt, F. Chung, T. Leighton, and A. Rosenberg. Optimal simulations of tree machines. In Proceedings of the 27th Annual Symposium on Foundations of Computer Science, pages 274-282, October 1986.
8. S.N. Bhatt and F.T. Leighton. A framework for solving VLSI graph layout problems. Journal of Computer and System Sciences, 28(2), 1984.
9. F. R. K. Chung. Separator theorems and their applications. In B. Korte, L. Lovasz, H. J. Promel, and A. Schriver, editors, Paths, Flows, and VLSI-Layout, pages 17-34. Springer-Verlag, New York, 1990.
10. R. Cole, B. Maggs, and R. Sitaraman. Multi-scale emulation: A technique for reconfiguring arrays with faults. Unpublished manuscript.
11. H. N. Djidjev. On the problem of partitioning planar graphs. SIAM Journal of Algebraic and Discrete Methods, 3:229-241, 1982.
12. M. R. Fellows. Encoding Graphs in Graphs. PhD thesis, Department of Computer Science, University of California, San Diego, CA, 1985.
13. P. Klein, S. Rao, and S. Plotkin. Excluded minors, network decomposition, and multicommodity flow. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, page To appear., May 1993.
14. R. Koch, T. Leighton, B. Maggs, S. Rao, and A. Rosenberg. Work-preserving emulations of fixed-connection networks. In Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pages 227-240, May 1989.
15. F. T. Leighton, Bruce Maggs, and Satish Rao. Universal routing algorithms. In 28th Annual Symposium on Foundations of Computer Science, IEEE, pages 256-269, 1988.
16. T. Leighton, B. Maggs, and R. Sitaraman. On the fault tolerance of some popular bounded-degree networks. In Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 542-552, October 1992.
17. C. E. Leiserson. Area-Efficient VLSI Computation. MIT Press, Cambridge, MA, 1983.
18. C. E. Leiserson. Fat-trees: universal networks for hardware-efficient supercomputing. IEEE Transactions on Computers, C-34(10):892-901, October 1985.
19. C.E. Leiserson. Area-efficient layouts (for VLSI). In Proceedings of the 2Its Annual Symposium on Foundations of Computer Science, October 1980.
20. R.J. Lipton and R.E. Tarjan. A separator theorem for planar graphs. SIAM Journal of Applied Mathematics, 8(2):177-189, April 1979.
21. G. L. Miller, S.-H. Teng, and S. A. Vavasis. An unified geometric approach to graph separators. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, pages 538-547, 1991.
22. S. Rao. Faster algorithms for finding small separators in planar graphs. In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 229-240, May 1992.
23. E. J. Schwabe. On the computational equivalence of hypercube-derived networks. In Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, pages 388-397, July 1990.
24. L. Valiant. Universality considerations in VLSI circuits. IEEE Transactions on Computers, 1981.