On the expected value of a number of disconnected pairs of nodes in unreliable network
AS Rodionov, OK Rodionova, H Choo - International Conference on …, 2007 - Springer
AS Rodionov, OK Rodionova, H Choo
International Conference on Computational Science and Its Applications, 2007•SpringerThe 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.
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.
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.
Springer
Showing the best result for this search. See all results