Skip to main content
SpringerLink
Log in

Transitively equivalent directed 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. A. A. Zykov, Theory of Finite Graphs [in Russian], Izd. Nauka, Novosibirsk (1969).

    Google Scholar 

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

  3. I. A. Faradzhev, “Effective algorithms for solving some problems for directed graphs,” Zh. Vychislit. Matem. i Matem. Fiz.,10, No. 3 (1970).

  4. I. B. Zadykhailo, “An efficient algorithm for distinguishing critical paths in a directed graph without circuits,” Ékon. i Matem. Metody,1, No. 3 (1965).

  5. D. M. Moyles and G. L. Thompson, “An algorithm for finding a minimum equivalent graph of a digraph,” J. Asso. Computing Machinery,16, No. 3 (1969).

Download references

Authors
  1. V. V. Martynyuk
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 39–43, January–February, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Martynyuk, V.V. Transitively equivalent directed graphs. Cybern Syst Anal 9, 45–49 (1973). https://doi.org/10.1007/BF01068665

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation