@inproceedings{109475c39ce942da93f296ab1e058832,
title = "On the expected value of a number of disconnected pairs of nodes in unreliable network",
abstract = "The task of calculating the expectation of a number of disconnected pairs of nodes (EDP) in unreliable network is discussed. The task is NP-hard, that is it requires exhaustive search of subgraphs. The techniques for decreasing a number of enumerated subgraphs by using the branching (factoring) method and taking advantage from possible structural features are discussed. Usage of chains for reduction of the task dimension is considered.",
author = "Rodionov, \{Alexey S.\} and Rodionova, \{Olga K.\} and Hyunseung Choo",
year = "2007",
doi = "10.1007/978-3-540-74484-9\_46",
language = "English",
isbn = "9783540744825",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
number = "PART 3",
pages = "534--543",
booktitle = "Computational Science and Its Applications - ICCSA 2007 - International Conference, Proceedings",
edition = "PART 3",
note = "International Conference on Computational Science and its Applications, ICCSA 2007 ; Conference date: 26-08-2007 Through 29-08-2007",
}