Skip to main content
SpringerLink
Log in

Space efficient algorithms for some graph theoretical problems

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

We present space-efficient-O(log2 n)-deterministic algorithms for some graph theoretical problems such as planarity testing, producing a plane embedding, finding minimum cost spanning trees, obtaining the connected, biconnected and triconnected components of a graph. Previous planarity algorithms used Ω(n) space. Several algorithms are based on a space-efficient matrix inversion method. The same bounds hold for uniform circuit depth.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A., Hopcroft, J.E., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA (1974)

    Google Scholar 

  2. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. American Elsevier, NY (1977)

    Google Scholar 

  3. Borodin, A., Cook, S., Pippinger, N.: personal communication

  4. Chandra, A.K., Stockmeyer, L.: Alternation. Proc. 17th Ann. FOCS Symp. 98–108 (1976)

  5. Cook, S.: An Observation on Time-Storage Tradeoff. JCSS 9, 308–316 (1974)

    Google Scholar 

  6. Csanky, L.: Fast Parallel Matrix Inversion Algorithms. SIAM J. COMP. 5, 618–623 (1976)

    Google Scholar 

  7. Harary, F.: Graph Theory. Addison-Wesley, Reading, MA (1969)

    Google Scholar 

  8. Hartmanis, J., Simon, J.: On the Power of Multiplication in Random Access Machines. Proc. 15th SWAT Symp. 13–23 (1974)

  9. Heller, D.: A Determinant Theorem with Applications to Parallel Algorithms. Tech. Rept., Dept. Comp. Sci., Carnegie-Mellon University (March 1973)

  10. Ja'Ja', J., Simon, J.: Some Space-Efficient Algorithms. Proc. 17th Allerton Conference 677–684 (1979)

  11. Ja'Ja', J., Simon, J.: Parallel Algorithms in Graph Theory: Planarity Testing. CS-80-14, Computer Science Department, The Pennsylvania State University, June 1980

  12. Lewis, P.M., Stearns, R.E., Hartmanis, J.: Memory Bounds for Recognition of Context-Free and Context-Sensitive Languages. IEEE Conf. Rec. Switch. Th., Ann Arbor, Mich. 191–202 (1951)

  13. McLane, S.: A Structural Characterization of Planar Combinatorial Graphs. Duke Math. J. 3, 460–472 (1937)

    Google Scholar 

  14. Paul, W.J., Rudiger, R.: On Space vs. Time II. Proc. 20th FOCS Conf. (1979)

  15. Savage, C., Ja'Ja', J.: Fast, Efficient Parallel Algorithms for Some Graph Problems. submitted for publication

  16. Savitch, W.: Relationships Between Nondeterministic and Deterministic Space Complexities. JCSS 4, 177–192 (1970)

    Google Scholar 

  17. Simon, J.: On Tape Bounded Probabilistic Turing Machine Acceptors. To appear in TCS

  18. Tutte, W.: How to Draw a Graph. Proc. London Math. Soc. B13, 743–768 (1963)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Joseph Ja'Ja' & Janos Simon

Authors
  1. Joseph Ja'Ja'
    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

Additional information

Research partially supported by NSF grants No. MCS 79-05006 and MCS 78-27600.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ja'Ja', J., Simon, J. Space efficient algorithms for some graph theoretical problems. Acta Informatica 17, 411–423 (1982). https://doi.org/10.1007/BF00264160

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation