Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




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

Problemy Peredachi Informatsii, 1993, Volume 29, Issue 2, Pages 85–95 (Mi ppi179)  
This article is cited in 3 scientific papers (total in 3 papers)

Large Systems

Lower Bounds of Connectedness Probability for Some Classes of Random Graphs

V. P. Polesskii
Full-text PDF (1201 kB) Citations (3)
Abstract: Efficiently computable lower bounds of connectedness probability for classes of random graphs generated by 2-connected multigraphs with frameness or forestness 2 are established.
Received: 06.04.1992
Bibliographic databases:
Document Type: Article
UDC: 621.391.1:519.4
Language: Russian
Citation: V. P. Polesskii, “Lower Bounds of Connectedness Probability for Some Classes of Random Graphs”, Probl. Peredachi Inf., 29:2 (1993), 85–95; Problems Inform. Transmission, 29:2 (1993), 176–185
Citation in format AMSBIB
\Bibitem{Pol93}
\by V.~P.~Polesskii
\paper Lower Bounds of Connectedness Probability for Some Classes of Random Graphs
\jour Probl. Peredachi Inf.
\yr 1993
\vol 29
\issue 2
\pages 85--95
\mathnet{http://mi.mathnet.ru/ppi179}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1239164}
\zmath{https://zbmath.org/?q=an:0797.05072}
\transl
\jour Problems Inform. Transmission
\yr 1993
\vol 29
\issue 2
\pages 176--185
Linking options:
  • https://www.mathnet.ru/eng/ppi179
  • https://www.mathnet.ru/eng/ppi/v29/i2/p85
    • This publication is cited in the following 3 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:223
    Full-text PDF :112
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024