Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

Prikladnaya Diskretnaya Matematika, 2013, Number 1(19), Pages 84–92 (Mi pdm403)  
This article is cited in 1 scientific paper (total in 1 paper)

Applied Graph Theory

All-pairs shortest paths algorithm for high-dimensional sparse graphs

A. R. Urakov, T. V. Timeryaev

Ufa State Aviation Technical University
Full-text PDF (618 kB) Citations (1)
References:
PDF
HTML
Abstract: All-pairs shortest path problem on weighted undirected sparse graphs is considered. “Disassembly and assembly of graph” algorithm is proposed to obtain the solution of the problem for the given graph using the solution of the problem for a small-dimensional graph. The algorithm is compared with one of the fastest classic algorithms on public source data.
Keywords: APSP, graph disassembly, graph assembly, sparse graphs.
Document Type: Article
UDC: 519.178
Language: Russian
Citation: A. R. Urakov, T. V. Timeryaev, “All-pairs shortest paths algorithm for high-dimensional sparse graphs”, Prikl. Diskr. Mat., 2013, no. 1(19), 84–92
Citation in format AMSBIB
\Bibitem{UraTim13}
\by A.~R.~Urakov, T.~V.~Timeryaev
\paper All-pairs shortest paths algorithm for high-dimensional sparse graphs
\jour Prikl. Diskr. Mat.
\yr 2013
\issue 1(19)
\pages 84--92
\mathnet{http://mi.mathnet.ru/pdm403}
Linking options:
  • https://www.mathnet.ru/eng/pdm403
  • https://www.mathnet.ru/eng/pdm/y2013/i1/p84
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:457
    Full-text PDF :465
    References:46
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024