Skip to main content
SpringerLink
Log in

Lower bounds for solving undirected graph problems on VLSI

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1983)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 154))

Included in the following conference series:

Abstract

We study VLSI solutions to the connected component problem on networks that have area too small to store all the edges of the graph for the entire computation. We give lower bounds on the time needed to solve this problem on such networks. The lower bounds use a new proof technique combining adversary strategy, information flow, and Kolmogorov complexity arguments. The lower bounds obtained for the connected components problem hold for a number of other undirected graph problems.

Research supported in part by NSF grant MCS81-04876 and USARO Contract Number DAAG29-82-K-0110.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Abelson, P. Andreae, ‘Information Transfer and Area-Time Tradeoffs for VLSI Multiplication', CACM, Vol. 23, pp 20–23, Jan. 1980.

    Google Scholar 

  2. M.J. Atallah, S.R. Kosaraju, ‘Graph Problems on a Mesh-Connected Processor Array', Proc. of the 14-th Ann. Symp. on Th. of Comp., pp 345–353, 1982.

    Google Scholar 

  3. R.P. Brent, H.T. Kung, ‘The Area-Time Complexity of Binary Multiplication', JACM, Vol.28, pp 521–534, July 1981.

    Google Scholar 

  4. B. Chazelle, L. Monier, ‘A Model of Computation for VLSI with Related Complexity Results', 13-th Ann. Symp. on Th. of Comp., pp 318–325, 1981.

    Google Scholar 

  5. G.N. Frederickson, D.B. Johnson, ‘Generalized Selection and Ranking: Sorted Matrices', Tech. Report of The Pennsylvania State University, CS-81-12, 1981.

    Google Scholar 

  6. L.J. Guibas, H.T. Kung, CD. Thompson, ‘Direct VLSI Implementations for Combinatorial Algorithms', Proc. of Conf. VLSI Tech. Design and Fabrication, Caltech 1979.

    Google Scholar 

  7. S.E. Hambrusch, ‘The Complexity of Graph Problems on VLSI', Ph.D. thesis, The Pennsylvania State University, 1982.

    Google Scholar 

  8. S.E. Hambrusch, ‘VLSI Algorithms for the Connected Components Problem', SIAM J. on Computing, Vol. 12, No. 2, May 1983.

    Google Scholar 

  9. J. Ja'sJa', ‘The VLSI Complexity of Graph Problems', Tech. Report of The Pennsylvania State University, CS-81-25, October 1981.

    Google Scholar 

  10. J. Ja'sJa', V.K. Kumar, ‘Information Transfer in Distributed Computing with Applications to VLSI', Tech. Report of The Pennsylvania State University, CS-81-14, 1981.

    Google Scholar 

  11. H.T. Kung, C.E. Leiserson, 'systolic Arrays for VLSI', appeared in Introduction to VLSI Systems', C. Mead, L. Conway, Addison-Wesley, pp 260–292, 1960.

    Google Scholar 

  12. R.J. Lipton, R.S. Sedgewick, ‘Lower Bounds for VLSI', 13-th Ann. Symp. on Th. of Comp., pp 300–307, 1981.

    Google Scholar 

  13. R.J. Lipton, J. Valdes, ‘Census Function: An Approach to VLSI Upper Bounds', Proc. of the 22-nd Ann. Symp. on Found. of Comp. Sc, pp 13–22, 1981.

    Google Scholar 

  14. C. Mead, L. Conway, Introduction to VLSI Systems, Addison-Wesley, 1980.

    Google Scholar 

  15. D. Nath, S.N. Maheshwari, P.C.P. Bhatt, ‘Efficient VLSI Networks for Parallel Processing based on Orthogonal Trees', Techn. Report of the Indian Inst. of Techn., Delhi, April 1981.

    Google Scholar 

  16. W. Paul, ‘On Heads versus Tapes', 22-nd Ann. Symp. on Found, of Comp. Sc., pp 68–73, 1981.

    Google Scholar 

  17. W. Paul, J. Seiferas, J. Simon, ‘An Information Theoretic Approach to Time Bounds on On-line Computation', 12-th Ann. Symp. on Th. of Comp., pp 357–367, 1980.

    Google Scholar 

  18. F.P. Preparata, J.E. Vuillemin, ‘The Cube Connected Cycles: a Versatile Network for Parallel Computation', Proc. of 20-th annual IEEE FOCS Conf., pp 140–147, 1979.

    Google Scholar 

  19. L. Snyder, ‘Overview of the CHiP Computer', in John P. Gray, VLSI 1981, pp 237–246, Academic Press, 1981.

    Google Scholar 

  20. C.D. Thompson, ‘Area-Time Complexity for VLSI', 11-th Ann. Symp, on Th. of Comp., pp B1–88, 1979.

    Google Scholar 

  21. J.E. Vuillemin, ‘A Combinatorial Limit to the Computing Power of VLSI Circuits', 21-st Ann. Symp. on Found. of Comp. Sc., pp 294–300, 1980.

    Google Scholar 

  22. A. Yao, 'some Complexity Questions related to Distributed Computing', Proc. 11-th Ann. Symp. on Th. of Comp., pp 209–213, 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Sciences, Purdue University, 47907, West Lafayette, IN

    Susanne E. Hambrusch

  2. Department of Computer Science, The Pennsylvania State University, 16802, University Park, PA

    Janos Simon

Authors
  1. Susanne E. Hambrusch
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Janos Simon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Josep Diaz

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hambrusch, S.E., Simon, J. (1983). Lower bounds for solving undirected graph problems on VLSI. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036916

Download citation

  • DOI: https://doi.org/10.1007/BFb0036916

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12317-0

  • Online ISBN: 978-3-540-40038-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation