Skip to main content
SpringerLink
Log in

Methods and programs for generating random graphs

  • Published:
Journal of Soviet Mathematics Aims and scope Submit manuscript

Abstract

The paper is devoted to methods of generating flows of random graphs. Programs are presented in the language REFAL.

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

Literature cited

  1. Yu. G. Pollyak, Probabilistic Modeling on Computers [in Russian], Moscow (1971).

  2. V. F. Turchin, “Programming in the language REFAL,” Preprint Inst. Prikl. Mekh. Akad. Nauk SSSR, Nos. 41, 43, 46, 47, 49, Moscow (1971).

  3. K. V. Shakhbazyan and T. A. Tushkina, The method of branches and boundaries for the problem of parallel sequenching,” Zap. Nauchn. Sem. Leningr. Otd. Mat. Inst. Akad. Nauk SSSR,35, 146–155 (1973).

    Google Scholar 

  4. K. V. Shakhbazyan, T. A. Tushkina, V. S. Sokhranskaya, and P. M. Tovkach, “An experiment on the realization of a dispatcher algorithm for multiprocessor systems,” Upr. Sistemy Mashiny, No. 3, 84–85 (1975).

    Google Scholar 

Download references

Authors
  1. T. A. Tushkina
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklov AN SSSR, Vol. 54, pp. 259–264, 1975.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tushkina, T.A. Methods and programs for generating random graphs. J Math Sci 15, 670–673 (1981). https://doi.org/10.1007/BF01086546

Download citation

  • Issue Date:

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

Keywords

Search

Navigation