Network probabilistic connectivity: Optimal structures

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

doi:10.1007/978-3-540-24768-5_46

Network probabilistic connectivity: Optimal structures

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

Department of Computer Science and Engineering

Russian Academy of Sciences (Siberian Branch)

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

10 Scopus citations

Abstract

The problems of optimizing the network structure by the reliability criteria is discussed. The networks with absolutely reliable nodes and unreliable edges are considered, and a special attention is given to the structures based on rings. The tasks of global optimization, optimal interconnection, and optimal addition of new edges to existent graphs are considered and reliability polynomials are used for optimization. Some derivations are made with the use of original methods based on consideration of long chains.

Original language	English
Title of host publication	Computational Science and Its Applications - ICCSA 2004 - International Conference, Proceedings
Publisher	Springer Verlag
Pages	431-440
Number of pages	10
Edition	PART 4
ISBN (Print)	3540220607, 9783540220602
DOIs	https://doi.org/10.1007/978-3-540-24768-5_46
State	Published - 2004
Event	International Conference on Computational Science and Its Applications, ICCSA 2004 - Assisi, Italy Duration: 14 May 2004 → 17 May 2004

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 4
Volume	3046 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	International Conference on Computational Science and Its Applications, ICCSA 2004
Country/Territory	Italy
City	Assisi
Period	14/05/04 → 17/05/04

Access to Document

10.1007/978-3-540-24768-5_46

Cite this

Rodionova, O. K., Rodionov, A. S., & Choo, H. (2004). Network probabilistic connectivity: Optimal structures. In Computational Science and Its Applications - ICCSA 2004 - International Conference, Proceedings (PART 4 ed., pp. 431-440). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3046 LNCS, No. PART 4). Springer Verlag. https://doi.org/10.1007/978-3-540-24768-5_46

Rodionova, Olga K. ; Rodionov, Alexey S. ; Choo, Hyunseung. / Network probabilistic connectivity : Optimal structures. Computational Science and Its Applications - ICCSA 2004 - International Conference, Proceedings. PART 4. ed. Springer Verlag, 2004. pp. 431-440 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 4).

@inproceedings{2aeb3ecd88ba45f8913ce6df9d59669d,

title = "Network probabilistic connectivity: Optimal structures",

abstract = "The problems of optimizing the network structure by the reliability criteria is discussed. The networks with absolutely reliable nodes and unreliable edges are considered, and a special attention is given to the structures based on rings. The tasks of global optimization, optimal interconnection, and optimal addition of new edges to existent graphs are considered and reliability polynomials are used for optimization. Some derivations are made with the use of original methods based on consideration of long chains.",

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

year = "2004",

doi = "10.1007/978-3-540-24768-5\_46",

language = "English",

isbn = "3540220607",

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

publisher = "Springer Verlag",

number = "PART 4",

pages = "431--440",

booktitle = "Computational Science and Its Applications - ICCSA 2004 - International Conference, Proceedings",

edition = "PART 4",

note = "International Conference on Computational Science and Its Applications, ICCSA 2004 ; Conference date: 14-05-2004 Through 17-05-2004",

}

Rodionova, OK, Rodionov, AS & Choo, H 2004, Network probabilistic connectivity: Optimal structures. in Computational Science and Its Applications - ICCSA 2004 - International Conference, Proceedings. PART 4 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 4, vol. 3046 LNCS, Springer Verlag, pp. 431-440, International Conference on Computational Science and Its Applications, ICCSA 2004, Assisi, Italy, 14/05/04. https://doi.org/10.1007/978-3-540-24768-5_46

Network probabilistic connectivity: Optimal structures. / Rodionova, Olga K.; Rodionov, Alexey S.; Choo, Hyunseung.
Computational Science and Its Applications - ICCSA 2004 - International Conference, Proceedings. PART 4. ed. Springer Verlag, 2004. p. 431-440 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3046 LNCS, No. PART 4).

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

TY - GEN

T1 - Network probabilistic connectivity

T2 - International Conference on Computational Science and Its Applications, ICCSA 2004

AU - Rodionova, Olga K.

AU - Rodionov, Alexey S.

AU - Choo, Hyunseung

PY - 2004

Y1 - 2004

N2 - The problems of optimizing the network structure by the reliability criteria is discussed. The networks with absolutely reliable nodes and unreliable edges are considered, and a special attention is given to the structures based on rings. The tasks of global optimization, optimal interconnection, and optimal addition of new edges to existent graphs are considered and reliability polynomials are used for optimization. Some derivations are made with the use of original methods based on consideration of long chains.

AB - The problems of optimizing the network structure by the reliability criteria is discussed. The networks with absolutely reliable nodes and unreliable edges are considered, and a special attention is given to the structures based on rings. The tasks of global optimization, optimal interconnection, and optimal addition of new edges to existent graphs are considered and reliability polynomials are used for optimization. Some derivations are made with the use of original methods based on consideration of long chains.

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

U2 - 10.1007/978-3-540-24768-5_46

DO - 10.1007/978-3-540-24768-5_46

M3 - Conference contribution

AN - SCOPUS:50149093403

SN - 3540220607

SN - 9783540220602

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

SP - 431

EP - 440

BT - Computational Science and Its Applications - ICCSA 2004 - International Conference, Proceedings

PB - Springer Verlag

Y2 - 14 May 2004 through 17 May 2004

ER -

Rodionova OK, Rodionov AS, Choo H. Network probabilistic connectivity: Optimal structures. In Computational Science and Its Applications - ICCSA 2004 - International Conference, Proceedings. PART 4 ed. Springer Verlag. 2004. p. 431-440. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 4). doi: 10.1007/978-3-540-24768-5_46

Network probabilistic connectivity: Optimal structures

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this