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 3(17), Pages 103–107 (Mi pdm383)  
This article is cited in 1 scientific paper (total in 1 paper)

Applied Graph Theory

Connectivity of the planar graph with highly reliable edges

G. Sh. Tsitsiashvili, A. S. Losev

Institute of Applied Mathematics, Far-Eastern Branch of the Russian Academy of Sciences, Vladivostok, Russia
Full-text PDF (842 kB) Citations (1)
References:
PDF
HTML
Abstract: In this paper, an algorithm based on the concept of dual graphs is constructed for calculation of incoherence probability for planar graphs with the high reliable edges. Numerical experiments show that, in a comparison with the Monte-Carlo method, this algorithm decreases calculation complexity significantly.
Keywords: connectivity probability, dual graph, minimal cross section.
Document Type: Article
UDC: 519.248,519.176
Language: Russian
Citation: G. Sh. Tsitsiashvili, A. S. Losev, “Connectivity of the planar graph with highly reliable edges”, Prikl. Diskr. Mat., 2012, no. 3(17), 103–107
Citation in format AMSBIB
\Bibitem{TsiLos12}
\by G.~Sh.~Tsitsiashvili, A.~S.~Losev
\paper Connectivity of the planar graph with highly reliable edges
\jour Prikl. Diskr. Mat.
\yr 2012
\issue 3(17)
\pages 103--107
\mathnet{http://mi.mathnet.ru/pdm383}
Linking options:
  • https://www.mathnet.ru/eng/pdm383
  • https://www.mathnet.ru/eng/pdm/y2012/i3/p103
    • 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:311
    Full-text PDF :133
    References:60
    First page:1
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024