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, 1972, Volume 8, Issue 4, Pages 68–73 (Mi ppi868)  
Large Systems

Maximum of the Connectivity Probability

M. V. Lomonosov, V. P. Polesskii
Full-text PDF (660 kB)
Abstract: A particular case of maximization of the connectivity probability of a random graph is investigated.
Received: 15.02.1971
Bibliographic databases:
Document Type: Article
UDC: 621.395.74, 519.14
Language: Russian
Citation: M. V. Lomonosov, V. P. Polesskii, “Maximum of the Connectivity Probability”, Probl. Peredachi Inf., 8:4 (1972), 68–73; Problems Inform. Transmission, 8:4 (1972), 324–328
Citation in format AMSBIB
\Bibitem{LomPol72}
\by M.~V.~Lomonosov, V.~P.~Polesskii
\paper Maximum of the Connectivity Probability
\jour Probl. Peredachi Inf.
\yr 1972
\vol 8
\issue 4
\pages 68--73
\mathnet{http://mi.mathnet.ru/ppi868}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=323644}
\zmath{https://zbmath.org/?q=an:0335.05124}
\transl
\jour Problems Inform. Transmission
\yr 1972
\vol 8
\issue 4
\pages 324--328
Linking options:
  • https://www.mathnet.ru/eng/ppi868
  • https://www.mathnet.ru/eng/ppi/v8/i4/p68
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024