EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 29 / No 6 (1995) RAIRO-Theor. Inf. Appl., 29 6 (1995) 509-514 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 29, Number 6, 1995
Page(s) 509 - 514
DOI https://doi.org/10.1051/ita/1995290605091
Published online 01 February 2017
  1. 1. D. BARTH, F. PELLEGRINI, A. RASPAUD, and J. ROMAN, On bandwidth, cutwidth and quotient graphs, RAIRO Informatique, Théorique et Applications, to appear. [EuDML: 92520] [MR: 1377027] [Zbl: 0881.68089] [Google Scholar]
  2. 2. A. BEL HALA, Congestion optimale du plongement de l'ypercube H (n) dans la chaine P (2n), RAIRO Informatique, Théorique et Applications, 1993, 27, pp. 1-17. [MR: 1252607] [Zbl: 0803.68091] [Google Scholar]
  3. 3. G. BILARDI and F. PREPARATA, Area-time lower bound techniques with application to sorting, Algorithmica, 1986, 1, pp. 65-91. [MR: 833119] [Zbl: 0622.68044] [Google Scholar]
  4. 4. G. BREBNER, Relating routing graphs and two-dimensional grids, in: Proc. VLSI: Algorithms and Architectures, North Holland, 1985. [MR: 803728] [Zbl: 0564.94019] [Google Scholar]
  5. 5. D. KLEITMAN, F. T. LEIGHTON, M. LEPLEY and G. L. MILLER, New layouts for the shuffle-exchange graph, in: Proc. 13th Annual ACM Symposium on Theory of Computing, ACM Press, 1981, pp. 278-292. [Google Scholar]
  6. 6. T. LENGAUER, Upper and lower bounds for the min-cut linear arrangements problem on trees, SIAM J. Algebraic and Discrete Methods, 1982, 3, pp. 99-113. [MR: 644961] [Zbl: 0489.68060] [Google Scholar]
  7. 7. A. D. LOPEZ and H. F. S. LAW, A dense gate matrix layout method for MOS VLSI, IEEE Trans. Electron. Devices, 1980, 27, pp. 1671-1675. [Google Scholar]
  8. 8. K. NAKANO, Linear layout of generalized hypercubes, in: Proc. 19th Intl. Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science 790, Springer Verlag, Berlin, 1994, pp. 364-375. [MR: 1286286] [Google Scholar]
  9. 9. C. D. THOMPSON, Area-time complexity for VLSI, in: Proc. 11th Annual ACM Symposium on Theory of Computing, 1979, pp. 81-88. [MR: 564622] [Google Scholar]
  10. 10. J. D. ULLMAN, Computational Aspects of VLSI, Computer Science Press, Rockville, 1984. [Zbl: 0539.68021] [Google Scholar]
  11. 11. M. YANNAKAKIS, A polynomial algorithm for the Min Cut Linear Arrangement of trees, J. ACM, 1985, 32, pp. 950-988. [MR: 810346] [Zbl: 0633.68063] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.