Skip to main content
SpringerLink
Log in

Locating circuit bodies and documenting routing graphs

  • Software-Hardware Systems
  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

The paper considers the organization of correct iterative computations in problem-oriented systems with graph models of the application domain. The efficiency of the proposed method is confirmed by experimental data.

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. O. L. Perevozchikova and E. L. Yushchenko, Interactive Problem-Solving Computer Systems [in Russian], Naukova Dumka, Kiev (1986).

    Google Scholar 

  2. P. Mateti and N. Deo, "On algorithms for enumerating all circuits of a graph," SIAM J. Comput.,5, 90–99 (1976).

    Google Scholar 

  3. E. M. Reingold, J. Nievergelt, and N. Deo, Combinatorial Algorithms: Theory and Practice, Prentice Hall, Englewood Cliffs, NJ (1977).

    Google Scholar 

  4. R. G. Busacker and T. L. Saaty, Finite Graphs and Networks, McGraw-Hill, New York (1965).

    Google Scholar 

Download references

Authors
  1. G. É. Mikailov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 21–31, September–October, 1991.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mikailov, G.É. Locating circuit bodies and documenting routing graphs. Cybern Syst Anal 27, 652–660 (1991). https://doi.org/10.1007/BF01130534

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation