@inproceedings{93b8502fe95a4269a02749b799e56116,
title = "Network probabilistic connectivity: Using node cuts",
abstract = "The new algorithmic technique which allow higher efficiency in the precise calculation of the reliability of an undirected graph with absolutely reliable nodes and unreliable edges is considered in this paper. As graph's reliability we mean its probabilistic connectivity. The proposed technique is based on the reduction of the dimension of a calculated graph by considering its node's cuts. Comprehensive computer simulation results show the advantages of the proposed algorithms, that the calculation time decreases significantly in comparison with existent methods.",
author = "Migov, \{Denis A.\} and Rodionova, \{Olga K.\} and Rodionov, \{Alexey S.\} and Hyunseung Choo",
year = "2006",
doi = "10.1007/11807964\_71",
language = "English",
isbn = "3540368507",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "702--709",
editor = "Xiaobo Zhou and Oleg Sokolsky and Lu Yan and Lu Yan and Eun-Sun Jung and Zili Shao and Yi Mu and Dong-Chun Lee and Daeyoung Kim and Young-Sik Jeong and Cheng-Zhong Xu",
booktitle = "Emerging Directions in Embedded and Ubiquitous Computing - EUC 2006 Workshops",
note = "EUC 2006: Embedded and Ubiquitous Computing Workshops ; Conference date: 01-08-2006 Through 04-08-2006",
}