DeepAI AI Chat
Log In Sign Up

A Short Note on Parameterized Computation of Network Reliability with respect to Treewidth

by   Amir Kafshdar Goharshady, et al.

We consider the classic problem of network reliability. A network is given together with a source vertex, one or more target vertices and probabilities assigned to each of the edges. Each edge appears in the network with its associated probability and the problem is to determine the probability of having at least one source-to-target path. This problem is known to be NP-hard for general networks and has been solved for several special families. In this work we present a fixed-parameter algorithm based on treewidth, which is a measure of tree-likeness of graphs. The problem was already known to be solvable in linear time for bounded treewidth, however the known methods used complicated structures and were not easy to implement. We provide a significantly simpler and more intuitive algorithm that while remaining linear, is much easier to implement.


page 1

page 2

page 3

page 4


Target set selection with maximum activation time

A target set selection model is a graph G with a threshold function τ:V→...

Treewidth of display graphs: bounds, brambles and applications

Phylogenetic trees and networks are leaf-labelled graphs used to model e...

Distributed Treewidth Computation

Of all the restricted graph families out there, the family of low treewi...

On Guarding Orthogonal Polygons with Bounded Treewidth

There exist many variants of guarding an orthogonal polygon in an orthog...

List homomorphisms by deleting edges and vertices: tight complexity bounds for bounded-treewidth graphs

The goal of this paper is to investigate a family of optimization proble...