Network probabilistic connectivity: Exact calculation with use of chains

Olga K. Rodionova; Alexey S. Rodionov; Hyunseung Choo

doi:10.1007/978-3-540-24685-5_91

Network probabilistic connectivity: Exact calculation with use of chains

Olga K. Rodionova
, Alexey S. Rodionov
, Hyunseung Choo

Department of Computer Science and Engineering

Russian Academy of Sciences

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

9 Scopus citations

Abstract

The algorithmic techniques which allow high efficiency in the exact calculation of reliability of an undirected graph with absolutely reliable nodes and unreliable edges are considered in this paper. The new variant of the branching algorithm that allow branching by chains is presented along with improvement of series-parallel reduction method that permits the reduction of a long chain by one step.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Marian Bubak, Geert Dick van Albada, Peter M.A. Sloot, Jack J. Dongarra
Publisher	Springer Verlag
Pages	565-568
Number of pages	4
ISBN (Print)	9783540221142
DOIs	https://doi.org/10.1007/978-3-540-24685-5_91
State	Published - 2004

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3036
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Access to Document

10.1007/978-3-540-24685-5_91

Cite this

Rodionova, O. K., Rodionov, A. S., & Choo, H. (2004). Network probabilistic connectivity: Exact calculation with use of chains. In M. Bubak, G. D. van Albada, P. M. A. Sloot, & J. J. Dongarra (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 565-568). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3036). Springer Verlag. https://doi.org/10.1007/978-3-540-24685-5_91

Rodionova, Olga K. ; Rodionov, Alexey S. ; Choo, Hyunseung. / Network probabilistic connectivity : Exact calculation with use of chains. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Marian Bubak ; Geert Dick van Albada ; Peter M.A. Sloot ; Jack J. Dongarra. Springer Verlag, 2004. pp. 565-568 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{c4b5c368a9144db78d5517d815654ceb,

title = "Network probabilistic connectivity: Exact calculation with use of chains",

abstract = "The algorithmic techniques which allow high efficiency in the exact calculation of reliability of an undirected graph with absolutely reliable nodes and unreliable edges are considered in this paper. The new variant of the branching algorithm that allow branching by chains is presented along with improvement of series-parallel reduction method that permits the reduction of a long chain by one step.",

author = "Rodionova, \{Olga K.\} and Rodionov, \{Alexey S.\} and Hyunseung Choo",

year = "2004",

doi = "10.1007/978-3-540-24685-5\_91",

language = "English",

isbn = "9783540221142",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "565--568",

editor = "Marian Bubak and \{van Albada\}, \{Geert Dick\} and Sloot, \{Peter M.A.\} and Dongarra, \{Jack J.\}",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

Rodionova, OK, Rodionov, AS & Choo, H 2004, Network probabilistic connectivity: Exact calculation with use of chains. in M Bubak, GD van Albada, PMA Sloot & JJ Dongarra (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3036, Springer Verlag, pp. 565-568. https://doi.org/10.1007/978-3-540-24685-5_91

Network probabilistic connectivity: Exact calculation with use of chains. / Rodionova, Olga K.; Rodionov, Alexey S.; Choo, Hyunseung.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Marian Bubak; Geert Dick van Albada; Peter M.A. Sloot; Jack J. Dongarra. Springer Verlag, 2004. p. 565-568 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3036).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

T1 - Network probabilistic connectivity

T2 - Exact calculation with use of chains

AU - Rodionova, Olga K.

AU - Rodionov, Alexey S.

AU - Choo, Hyunseung

PY - 2004

Y1 - 2004

N2 - The algorithmic techniques which allow high efficiency in the exact calculation of reliability of an undirected graph with absolutely reliable nodes and unreliable edges are considered in this paper. The new variant of the branching algorithm that allow branching by chains is presented along with improvement of series-parallel reduction method that permits the reduction of a long chain by one step.

AB - The algorithmic techniques which allow high efficiency in the exact calculation of reliability of an undirected graph with absolutely reliable nodes and unreliable edges are considered in this paper. The new variant of the branching algorithm that allow branching by chains is presented along with improvement of series-parallel reduction method that permits the reduction of a long chain by one step.

UR - https://www.scopus.com/pages/publications/35048875229

U2 - 10.1007/978-3-540-24685-5_91

DO - 10.1007/978-3-540-24685-5_91

M3 - Chapter

AN - SCOPUS:35048875229

SN - 9783540221142

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 565

EP - 568

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Bubak, Marian

A2 - van Albada, Geert Dick

A2 - Sloot, Peter M.A.

A2 - Dongarra, Jack J.

PB - Springer Verlag

ER -

Rodionova OK, Rodionov AS, Choo H. Network probabilistic connectivity: Exact calculation with use of chains. In Bubak M, van Albada GD, Sloot PMA, Dongarra JJ, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2004. p. 565-568. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-24685-5_91

Network probabilistic connectivity: Exact calculation with use of chains

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this