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, 2012, Number 2(16), Pages 95–99 (Mi pdm368)  

This article is cited in 2 scientific papers (total in 2 papers)

Applied Graph Theory

Using weighted graphs features for fast searching their parameters

A. R. Urakov, T. V. Timeryaev

Ufa State Aviation Technical University, Ufa, Russia
Full-text PDF (525 kB) Citations (2)
References:
Abstract: In this paper, some algorithms are presented for the fast search of center, radius and diameter of weighted graphs on all-pairs shortest path matrix, using features of real-world road networks graphs. They are compared with algorithms searching these parameters by simple pass through elements of matrix.
Keywords: graph center, graph radius, graph diameter, all-pairs shortest path matrix, graph features, weighted graph.
Document Type: Article
UDC: 519.173.5
Language: Russian
Citation: A. R. Urakov, T. V. Timeryaev, “Using weighted graphs features for fast searching their parameters”, Prikl. Diskr. Mat., 2012, no. 2(16), 95–99
Citation in format AMSBIB
\Bibitem{UraTim12}
\by A.~R.~Urakov, T.~V.~Timeryaev
\paper Using weighted graphs features for fast searching their parameters
\jour Prikl. Diskr. Mat.
\yr 2012
\issue 2(16)
\pages 95--99
\mathnet{http://mi.mathnet.ru/pdm368}
Linking options:
  • https://www.mathnet.ru/eng/pdm368
  • https://www.mathnet.ru/eng/pdm/y2012/i2/p95
  • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:522
    Full-text PDF :242
    References:28
    First page:1
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024