Upravliaemie systemy
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Upravliaemie systemy, 1976, Issue 15, Pages 40–47 (Mi da1091)  
The problem of finding the shortest connecting tree with a constraint

S. A. Morozov
Full-text PDF (356 kB)
Received: 11.06.1974
Bibliographic databases:
Document Type: Article
UDC: 512.25/26+519.3:303.115
Language: Russian
Citation: S. A. Morozov, “The problem of finding the shortest connecting tree with a constraint”, Upravliaemie systemy, 1976, no. 15, 40–47
Citation in format AMSBIB
\Bibitem{Mor76}
\by S.~A.~Morozov
\paper The problem of finding the shortest connecting tree with a constraint
\jour Upravliaemie systemy
\yr 1976
\issue 15
\pages 40--47
\mathnet{http://mi.mathnet.ru/da1091}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=0485549}
\zmath{https://zbmath.org/?q=an:0425.05019}
Linking options:
  • https://www.mathnet.ru/eng/da1091
  • https://www.mathnet.ru/eng/da/y1976/i15/p40
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Diskretnyi Analiz i Issledovanie Operatsii
    Statistics & downloads:
    Abstract page:98
    Full-text PDF :43
    References:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025