Skip to main content
SpringerLink
Log in

Transforming a cyclic directed graph into an acyclic graph

  • 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. G. R. Putzolu and J. P. Roth. “A heuristic algorithm for the testing of asynchronous circuits,” IEEE Trans. Electronic Computers,C-20, No. 6 (1971).

  2. O. Ore, Theory of Graphs, American Mathematical Society Colloquium Publications, Vol. 38, Providence (1962).

  3. A. A. Korbut and Yu. Yu. Finkel'shtein, Discrete Programming [in Russian], Izd. Nauka, Moscow (1969).

    Google Scholar 

  4. C. V. Romamoorthy, “Analysis of graphs by connectivity considerations,” J. Assoc. Computing Machinery,13, No. 2 (1966).

  5. A. G. Lunts, “Application of Boolean matrix algebra to the analysis and synthesis of relay switching circuits,” Dokl. Akad. Nauk SSSR,70, No. 3 (1950).

Download references

Authors
  1. V. V. Filippovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 2, pp. 138–140, March–April, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Filippovich, V.V. Transforming a cyclic directed graph into an acyclic graph. Cybern Syst Anal 9, 348–351 (1973). https://doi.org/10.1007/BF01069094

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation