Skip to main content
SpringerLink
Log in

Parallel computations on graphs

  • Published:
Cybernetics Aims and scope

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

Literature Cited

  1. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “A theory of data structures and synchronous parallel computations,” Kibernetika, No. 6, 2–15 (1976).

    Google Scholar 

  2. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “A theory of hardware and software design for multiprocessor computers,” Kibernetika, No. 6, 1–15 (1978).

    Google Scholar 

  3. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Efficiency of parallel computations with limited resources,” Dokl. Akad. Nauk SSSR,254, No. 3, 527–530 (1980).

    Google Scholar 

  4. V. M. Glushkov, Yu. V. Kapitonova, A. A. Letichevskii, and S. P. Gorlach, “Macropipelined evaluation of functions on data structures,” Kibernetika, No. 4, 13–21 (1981).

    Google Scholar 

  5. V. A. Golovkin, Parallel Computing Systems [in Russian], Nauka, Moscow (1980).

    Google Scholar 

  6. E. Deker, D. Nassimi, and S. Sahni, “Parallel matrix and graph algorithms,” SIAM J. Comput.,10, No. 4, 657–675 (1981).

    Google Scholar 

  7. W. Hoffman, “Queueing models for parallel processing and their application to a hierarchical organized multiprocessing system,” in: Proc. Ist European Conf. on Parallel and Distrib. Process. (Toulouse 1979), Toulose (1979), pp. 221–227.

  8. B. Lint and T. Agerwala, “Communication issues in design and analysis of parallel algorithms,” IEEE Trans., Software Eng.,7, No. 2, 174–188 (1981).

    Google Scholar 

  9. F. P. Preparata and J. Veeillemin, “The cube-connected cycles: a versatile network for parallel computation,” Comm. ACM,24, No. 5, 300–309 (1981).

    Google Scholar 

  10. A. Aho, J. Hopcroft, and J. Ullman, Design and Analysis of Computer Algorithms, Addison-Wesley (1979).

  11. M. Flynn, “Very high-speed computing systems,” Proc. IEEE,54, 1901–1909 (1966).

    Google Scholar 

  12. A. O. Slisenko, “Complexity problem in computation theory,” Usp. Mat. Nauk,36, No. 6, 21–103 (1981).

    Google Scholar 

  13. V. N. Faddeeva and D. K. Faddeev, “Parallel computations in linear algebra, Parts 1, 2,” Kibernetika, No. 6, 28–40 (1977), No. 3, 18–31 (1982).

    Google Scholar 

  14. A. K. Chandra, “Maximal parallelism in matrix multiplication,” Rep. NRC-6193, IBM Watson Res. Center, Yorktown Heights, New York (1976).

    Google Scholar 

  15. Frances L. Van Scoy, “The parallel recognition of classes of graphs,” IEEE Trans., Computers,29, No. 7, 563–570 (1980).

    Google Scholar 

  16. E. A. Ivanov and V. P. Shevchenko, “Parallel computations on data structures,” in: Abstracts of papers at Soviet Conf. “Methods of Mathematical Logic in Artificial Intelligence and Systematic Programming” (Palanga, 1980), [in Russian], Part 2, Inst. Mat. Kibern. Akad. Nauk Litovskoi SSR, Vil'nyus (1980), pp. 189–191.

    Google Scholar 

  17. E. A. Ivanov, “Parallel algorithms on graphs,” Kibernetika, No. 3, 81–83 (1981).

    Google Scholar 

  18. D. S. Hirschberg, A. K. Chandra, and D. V. Sarwate, “Computing connected components on parallel computers,” Comm. ACM,22, No. 8, 461–464 (1979).

    Google Scholar 

  19. D. S. Hirschberg, “Parallel algorithms for the transitive closure and the connected components problems,” in: Proc. 8th Ann. ACM Symp. on Theory of Comput. (1976), pp. 55–57.

  20. C. Savage and J. Ja'Jal, “Fast efficient parallel algorithms for some graph problems,” SIAM J. Comput.,10, No. 4, 682–691 (1981).

    Google Scholar 

  21. D. M. Eckstein, “Parallel graph processing using depth-first search and breadth-first search,” PhD Thesis, Univ. of Iowa (1977).

  22. F. Y. Chin, J. Lam, and I. Chen, “Optimal parallel algorithms for the connected component problem,” in: Proc. Int. Conf. Parallel Process. (Aug. 25–28, 1981, New York), New York (1981), pp. 170–175.

  23. F. Y. Chin, J. Lum, and I. Chen, “Efficient parallel algorithms for some graph problems,” Comm. ACM,25, No. 9, 659–665 (1982).

    Google Scholar 

  24. E. Reingold, J. Nyvergeldt, and N. Deo, Combinatorial Algorithms. Theory and Practice [Russian translation], Mir, Moscow (1980).

    Google Scholar 

  25. N. Deo, C. Y. Pang, and R. E. Lord, “Two parallel algorithms for shortest path problem,” in: Proc. Int. Conf. Parallel Process., 1980, Washington (1980), pp. 244–253.

  26. J. Ja'Ja' and J. Simon, “Parallel algorithms in graph theory: planarity testing (preliminary version),” Lect. Notes Comput. Sci., No. 88, 305–319 (1980).

    Google Scholar 

  27. J. Ja'Ja' and J. Simon, “Parallel algorithms in graph theory: planarity testing,” SIAM J. Comput.,11, No. 2, 314–328 (1982).

    Google Scholar 

  28. S. Goodman and S. Hidetniemi, An Introduction to Algorithm Development and Analysis [Russian translation], Mir, Moscow (1981).

    Google Scholar 

  29. J. Bently, “A parallel algorithm for constructing minimum spanning trees,” J. Algorithms, No. 1, 51–59 (1980).

    Google Scholar 

  30. N. Deo and Y. B. Yoo, “Parallel algorithms for the minimum spanning tree problem,” in: Proc. Int. Conf. Parallel Process. (Aug. 25–28, 1981, New York), New York (1981), pp. 188–189.

  31. K. N. Levitt and W. H. Kautg, “Cellular arrays for the solution of graph problems,” Commun. ACM,15, No. 9, 781–801 (1972).

    Google Scholar 

  32. D. Nath and S. N. Maheshwari, “Parallel algorithms for the connected components and minimal spanning tree problems,” Inf. Process. Lett.,14, No. 1, 7–11 (1982).

    Google Scholar 

  33. F. P. Preparata, “New parallel-sorting schemes,” IEEE Trans. Computers,C-27, No. 7, 669–673 (1978).

    Google Scholar 

  34. E. A. Ivanov and V. P. Shevchenko, “Comparison of the time complexity of parallel algorithms for some problems,” in: Abstracts of papers at the 5th Soviet School-Seminar, “Parallel Programming and High-Throughput Systems” (Simferopol', 1982) [in Russian], Part 3, Naukova Dumka, Kiev (1982), pp. 15–17.

    Google Scholar 

  35. L. Kucera, “Parallel computation and conflicts in memory access,” Inf. Process. Lett.,14, No. 2, 93–96 (1982).

    Google Scholar 

  36. Y. Shiloach and U. Vishkin, “AnO(log n) parallel connectivity algorithm,” J. Algorithms,3, No. 1, 57–67 (1982).

    Google Scholar 

Download references

Authors
  1. E. A. Ivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. P. Shevchenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 89–94, 107, May–June, 1984.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ivanov, E.A., Shevchenko, V.P. Parallel computations on graphs. Cybern Syst Anal 20, 418–425 (1984). https://doi.org/10.1007/BF01068475

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation