Abstract
In this paper, we consider problems related to the network reliability problem, restricted to graphs of bounded treewidth. We look at undirected simple graphs with each vertex and edge a number in [0,1] associated. These graphs model networks in which sites and links can fail, with a given probability, independently of whether other sites or links fail or not. The number in [0,1] associated to each element is the probability that this element does not fail. In addition, there are distinguished sets of vertices: a set S of servers, and a set L of clients.
This paper presents a dynamic programming framework for graphs of bounded treewidth for computing for a large number of different properties Y whether Y holds for the graph formed by the nodes and edges that did not fail. For instance, it is shown that one can compute in linear time the probability that all clients are connected to at least one server, assuming the treewidth of the input graph is bounded. The classical S- terminal reliability problem can be solved in linear time as well using this framework. The method is applicable to a large number of related questions. Depending on the particular problem, the algorithm obtained by the method uses linear, polynomial, or exponential time.
This research was partially supported by EC contract IST-1999-14186: Project ALCOM-FT (Algorithms and Complexity — Future Technologies).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
S. Arnborg, A. Proskurowski: Linear time algorithms for NP-hard problems restricted to partial k-trees. Discrete Appl. Math. 23, (1989), 11–24
H. L. Bodlaender: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25/6 (1996), 1305–1317
H. L. Bodlaender: A tourist guide through treewidth. Acta Cybernet. 11 (1993), 1–23
H. L. Bodlaender: Treewidth: Algorithmic techniques and results. In I. Privara and P. Ruzicka, editors, Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS’ 97, LNCS 1295, (1997), 19–36
J. Carlier, C. Lucet: A decomposition algorithm for network reliability evaluation. Discrete Appl. Math. 65, (1996), 141–156
C. Lucet, J.-F. Manouvrier, J. Carlier: Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs. Algorithmica 27, (2000), 316–336
E. Mata-Montero: Reliability of Partial k-tree Networks. Ph.D. Thesis, Technical report: CIS-TR-90-14, University of Oregon, (1990)
J. S. Provan, M. O. Ball: The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput. 12/4, (1983), 777–788
A. Rosenthal: Computing the reliability of complex networks. SIAM J. Appl. Math. 32, (1977), 384–393
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wolle, T. (2002). A Framework for Network Reliability Problems on Graphs of Bounded Treewidth. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_13
Download citation
DOI: https://doi.org/10.1007/3-540-36136-7_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00142-3
Online ISBN: 978-3-540-36136-7
eBook Packages: Springer Book Archive