Mata-Montero, Erick2023-06-202023-06-201989-10-20https://hdl.handle.net/1794/2843828 pagesThe resilience of a network is the expected number of pairs of nodes that can communicate. Computing the resilience of a network has been shown to be a #P-complete problem for planar networks and to take O(n)^2 time for n-node partial 2-tree networks. We present an O(n) time algorithm to compute the resilience of partial 2-tree networks on n-nodes, and, for a fixed k, an O(n)^2 algorithm to compute the resilience of n-node partial k-tree networks given with an embedding in a k-tree.enCreative Commons BY-NC-ND 4.0-USpartial 2-tree networksplanar networksnetwork resilienceArticle