Skip to main content
SpringerLink
Log in

Automation of printed-circuit design

  • 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. S. E. Markosyan, K. R. Arutyunyan, et al., “Design of large multilayer printed-circuit panels,” Vopr. Radioelektroniki, Ser. EVT, No. 4 (1972).

  2. S. E. Markosyan, “Coloring of the vertices of interval graphs,” Vopr. Radioelektroniki, Ser. AVT, No. 4 (1972).

  3. G. G. Geoletsyan, “Optimal location of graph vertices on a line,” Dokl. Akad. Nauk, Arm. SSR,56, No. 5 (1973).

    Google Scholar 

  4. A. V. Petrosyan and Yu. G. Anastasyan, “An optimal-location problem,” Vopr. Radioelektroniki, Ser. EVT, No. 8 (1971).

  5. G. G. Geoletsyan, “An algorithm for locating the nodes of a tree at equally remote points on a line,” Vopr. Radioelektroniki, Ser. EVT, No. 4 (1972).

  6. M. A. Sheidvasser, “Optimal ordering of the vertices of an oriented tree,” Kibernetika, No. 3 (1972).

  7. R. Redzheevskii, “Arithmetic expressions and trees,” Kib. Sborn., No. 7 (1970).

  8. T. A. J. Nicholson, “Permutation procedure for minimizing the number of crossings in a network,” IEE Proceedings,115, London. (January, 1968).

  9. G. S. Plesnevich, “Disposition in a plane,” in: Collected Volume: Computing Systems [in Russian], No. 6, Novosibirsk (1963).

  10. W. Bader, “Das topologische problem der gedrukten schaltung”, Archiv fur Electrotechnik,49, No. 1 (1964).

  11. W. Fisher, “Identification of planar graphs with incidence matrices”, in: Express Information, Technical Cybernetics [in Russian], No. 44, Moscow (1966).

  12. A. Lempel, S. Eveu, and Y. Cederbaum, “An algorithm for planarity testing of graph”, in: Theorie des Graphs (Actes Journees Inst. Etades ICC, Rome, 1966), Dunod, Paris (1967).

    Google Scholar 

  13. A. A. Zykov, Theory of Finite Graphs [in Russian], Nauka, Novosibirsk (1972).

    Google Scholar 

  14. L. Ford and D. R. Falkerson, Flows in Networks, Princeton University Press (1962).

  15. A. N. Belyakov and V. S. Bugaev, “A method of distributing conductors in multilayer printed circuits”, Trudy MIEM, No. 16, Chapt. 1 (1971).

  16. C. Berge The Theory of Graphs and its Applications [Russian translation], IL, Moscow (1962).

    Google Scholar 

  17. M. E. Shtein, “Orthogonal graphs for optimal circuit connections”, Izv. AN SSSR, Tekh. Kib., No. 2 (1970).

  18. M. E. Shtein, “Optimal component location”, Izv. AN SSSR, Tekh. Kib., No. 4 (1971).

  19. C. V. Ramamoorty and L-C. C. Chang, “System segmentation for the parallel diagnosis of computers”, IEEE Trans. on Computers,C 20, No. 3 (1971).

  20. W. S. Mayeda and C. V. Ramamoorty, “Distinguishability criteria in oriented graphs and their application to computer diagnosis — 1”, IEEE Trans. on Computers,C 16, No. 4 (1969).

    Google Scholar 

Download references

Authors
  1. A. V. Petrosyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu. G. Shukuryan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. S. E. Markosyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. S. L. Ambaryan
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 1, pp. 50–57, January–February, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Petrosyan, A.V., Shukuryan, Y.G., Markosyan, S.E. et al. Automation of printed-circuit design. Cybern Syst Anal 10, 59–69 (1974). https://doi.org/10.1007/BF01069019

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation