Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find






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


Avtomatika i Telemekhanika, 1982, Issue 12, Pages 85–96 (Mi at5676)  

Developing Systems

An economical algorithm for obtaining a shortest path through a single color connected graph

S. A. Viches

Moscow
Abstract: The problem of the shortest path through a graph is reduced to a Chinese postman problem with subproblems of obtaining the minimal perfect weighted matching, the largest matching, and Eulerian search. For the latter two economical algorithms are proposed, their convergence proved and effectiveness estimated. They reduce the load 'estimate of the entire problem.

Received: 24.02.1982
Bibliographic databases:
Document Type: Article
UDC: 681.327.21/22-003.6
Language: Russian
Citation: S. A. Viches, “An economical algorithm for obtaining a shortest path through a single color connected graph”, Avtomat. i Telemekh., 1982, no. 12, 85–96; Autom. Remote Control, 43:12 (1982), 1569–1579
Citation in format AMSBIB
\Bibitem{Vic82}
\by S.~A.~Viches
\paper An economical algorithm for obtaining a shortest path through a single color connected graph
\jour Avtomat. i Telemekh.
\yr 1982
\issue 12
\pages 85--96
\mathnet{http://mi.mathnet.ru/at5676}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=711650}
\zmath{https://zbmath.org/?q=an:0511.90092}
\transl
\jour Autom. Remote Control
\yr 1982
\vol 43
\issue 12
\pages 1569--1579
Linking options:
  • https://www.mathnet.ru/eng/at5676
  • https://www.mathnet.ru/eng/at/y1982/i12/p85
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Avtomatika i Telemekhanika
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024