Doklady Akademii Nauk SSSR
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Dokl. Akad. Nauk:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Doklady Akademii Nauk SSSR, 1971, Volume 200, Number 4, Pages 773–776 (Mi dan36450)  
MATHEMATICS

Algorithm for the shortest connection of a group of graph vertices

A. Yu. Levin
Full-text PDF (549 kB)
Presented: L. V. Kantorovich
Received: 02.02.1971
Bibliographic databases:
Document Type: Article
UDC: 519.1
Language: Russian
Citation: A. Yu. Levin, “Algorithm for the shortest connection of a group of graph vertices”, Dokl. Akad. Nauk SSSR, 200:4 (1971), 773–776
Citation in format AMSBIB
\Bibitem{Lev71}
\by A.~Yu.~Levin
\paper Algorithm for the shortest connection of a group of graph vertices
\jour Dokl. Akad. Nauk SSSR
\yr 1971
\vol 200
\issue 4
\pages 773--776
\mathnet{http://mi.mathnet.ru/dan36450}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=0285434}
\zmath{https://zbmath.org/?q=an:0243.05119}
Linking options:
  • https://www.mathnet.ru/eng/dan36450
  • https://www.mathnet.ru/eng/dan/v200/i4/p773
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Statistics & downloads:
    Abstract page:271
    Full-text PDF :139
    References:4
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026