Skip to main content
SpringerLink
Log in

Parallel algorithms 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, M. B. Ignat'ev, V. A. Myasnikov, and V. A. Torgashev, Recursive Machines and Computer Techniques [in Russian], Preprint No. 74-57, Inst. Kibern. Akad. Nauk Ukr. SSR, Kiev (1974).

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

Download references

Authors
  1. E. A. Ivanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 3, pp. 81–83, May–June, 1981.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ivanov, E.A. Parallel algorithms on graphs. Cybern Syst Anal 17, 381–383 (1981). https://doi.org/10.1007/BF01068982

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation