Multiterminal resilience for series-parallel networks
Article first published online: 14 JUN 2007
DOI: 10.1002/net.20186
Copyright © 2007 Wiley Periodicals, Inc.
Additional Information
How to Cite
Farley, T. R. and Colbourn, C. J. (2007), Multiterminal resilience for series-parallel networks. Networks, 50: 164–172. doi: 10.1002/net.20186
Publication History
- Issue published online: 14 JUN 2007
- Article first published online: 14 JUN 2007
- Manuscript Accepted:
- Manuscript Received:
- Abstract
- References
- Cited By
Keywords:
- network resilience;
- network reliability;
- series-parallel networks
Abstract
Network resilience measures the average two-terminal reliability (connectedness) of a network. Multiterminal resilience extends this measure to any k vertices; it is the average k-terminal reliability of a network. This generalizes two well-studied network connectedness measures. Calculating multiterminal resilience on general networks encompasses all-terminal reliability and thus is NP-hard. Multiterminal resilience is examined on undirected series-parallel networks, and an efficient (polynomial time) algorithm is developed for calculating the resilience for every k. Applications in mobile ad hoc and sensor networks are outlined. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 50(2), 164–172 2007

1097-0037/asset/NET_centre.gif?v=1&s=3b4a007baeb0bb143afbd4cdc905958e631876aa)
1097-0037/asset/cover.gif?v=1&s=ecd753a2b50d85eda1392633ee6b4b9b5040a7ed)