Skip to main content
SpringerLink
Log in

A shifting algorithm for min-max tree partitioning

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

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

Included in the following conference series:

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. BECKER, R.I., PERL, Y. and SCHACH, S.R. A shifting algorithm for min-max tree partitioning, Technical Report, Computer Science Department, University of Cape Town, Rondebosch, South Africa.

    Google Scholar 

  2. COOK, S.A. The complexity of theorem proving procedures. Proc. Third ACM Symp. on Theory of Computing, 1971, pp. 151–159.

    Google Scholar 

  3. GAREY, M.R. and JOHNSON, D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman and Co., San Francisco, 1979.

    Google Scholar 

  4. HADLOCK, F. Minimum spanning forests of bounded trees. Proc. Fifth S.E. Conf. on Combinatorics, Graph Theory, and Computing, 1974, pp.449–460.

    Google Scholar 

  5. HOSKEN, W.H. Optimum partitions of tree addressing structures, SIAM J. Computing, 4, 3(1975), pp. 341–347.

    Google Scholar 

  6. KARP, R.M. Reducibility among combinatorial problems. In Complexity of Computer, Computations, R.E. Miller and J.W. Thatcher, Eds., Plenum Press, New York, 1972, pp. 85–104.

    Google Scholar 

  7. KUNDU, S. and MISRA, J. A linear tree partitioning algorithm. SIAM J. Computing, 6,1(1977), pp.151–154.

    Google Scholar 

  8. PERL, Y. and SCHACH, S.R. Max-min tree partitioning. To appear in JACM.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Cape Town, South Africa

    Ronald I. Becker

  2. Bar-Ilan University, Israel

    Yehoshua Perl

  3. University of Cape Town, South Africa

    Stephen R. Schach

Authors
  1. Ronald I. Becker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yehoshua Perl
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stephen R. Schach
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jaco de Bakker Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Becker, R.I., Perl, Y., Schach, S.R. (1980). A shifting algorithm for min-max tree partitioning. In: de Bakker, J., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 1980. Lecture Notes in Computer Science, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10003-2_60

Download citation

  • DOI: https://doi.org/10.1007/3-540-10003-2_60

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10003-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation