Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Hierarchical graph structures and program facilities for their manipulation

  • 12 Accesses

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

Literature Cited

  1. 1.

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

  2. 2.

    N. I. Skrigan and A. S. Nikitin, “Manipulation of hierarchical graph structures in extended PL/I OS (the language GRASPL),” Preprint IM Akad. Nauk BSSR, No. 6 (62) (1979).

  3. 3.

    N. I. Shikhavtsova, “An extension of the language PL/I OS for graph description and manipulation,” in: Mathematical Methods and Their Application [in Russian], Minsk (1977), pp. 56–58.

  4. 4.

    A. S. Nikitin and V. N. Vengerov, “An algorithm for suboptimal cutting of weighted graphs into a specified number of blocks,” in: Discrete Transducers [in Russian], Kiev (1976), pp. 40–50.

  5. 5.

    V. N. Vengerov and A. S. Nikitin, “A heuristic algorithm for cutting weighted graphs,” VESTSI Akad. Nauk BSSR, Ser. Fiz. Mat., No. 5, 26–30 (1979).

Download references

Additional information

Translated from Kibernetika, No. 2, pp. 31–34, March–April, 1982.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Nikitin, A.S., Skrigan, N.I. Hierarchical graph structures and program facilities for their manipulation. Cybern Syst Anal 18, 179–183 (1982). https://doi.org/10.1007/BF01074527

Download citation


  • Operating System
  • Artificial Intelligence
  • System Theory
  • Graph Structure
  • Hierarchical Graph