An efficient family of methods to evaluate network reliability is the class of factoring algorithms. Their efficiency is due to the use of reliability-preserving reductions (for instance, series-parallel ones). In this work, we follow a similar approach for the problem of counting the (s,t)-mincuts of a graph with size i, for all i. In order to take into account these possible reductions, the paper presents a technique based on a factoring formula, similar to the relation of Moskowitz, to count the number of (s,t)-mincuts of each size. This formula is applied recursively and various reductions, with computational cost polynomial in the size of the network, are used in order to reduce the size of the studied graph
Evaluating the network reliability is an important topic in the planning, designing, and control of ...
13 pages, 10 figures, full version of the paper accepted in WG 2019The parameterized complexity of c...
Evaluating the network reliability is an important topic in the planning, designing, and control of ...
An efficient family of methods to evaluate network reliability is the class of factoring algorithms....
Let G = (V,E) be an undirected graph whose edges may fail, and let G, denote G with a set K V speci...
Let G = (V,E) be an undirected graph whose edges may fail, and let G, denote G with a set K V speci...
Finding and counting minimum cuts in graphs can be useful in image processing and segmentation and i...
[[abstract]]© 2006 Elsevier - Evaluating the network reliability is an important topic in the planni...
[[abstract]]Evaluating the network reliability is an important topic in the planning, designing, and...
In this work we present a new and efficient recursive algorithm that enumerate all the s-t minimal c...
The reliability polynomial of a graph gives the probability that a graph is connected as a function ...
AbstractThe reliability of a network can be efficiently bounded using graph-theoretical techniques b...
In the first part of this thesis we generalise the well-known K-terminal reliability R(G,K) to diffe...
We consider the classic problem of NETWORK RELIABILITY. A network is given together with a source ve...
Abstract. Karger (SIAM Journal on Computing, 1999) developed the first fully-polynomial approximatio...
Evaluating the network reliability is an important topic in the planning, designing, and control of ...
13 pages, 10 figures, full version of the paper accepted in WG 2019The parameterized complexity of c...
Evaluating the network reliability is an important topic in the planning, designing, and control of ...
An efficient family of methods to evaluate network reliability is the class of factoring algorithms....
Let G = (V,E) be an undirected graph whose edges may fail, and let G, denote G with a set K V speci...
Let G = (V,E) be an undirected graph whose edges may fail, and let G, denote G with a set K V speci...
Finding and counting minimum cuts in graphs can be useful in image processing and segmentation and i...
[[abstract]]© 2006 Elsevier - Evaluating the network reliability is an important topic in the planni...
[[abstract]]Evaluating the network reliability is an important topic in the planning, designing, and...
In this work we present a new and efficient recursive algorithm that enumerate all the s-t minimal c...
The reliability polynomial of a graph gives the probability that a graph is connected as a function ...
AbstractThe reliability of a network can be efficiently bounded using graph-theoretical techniques b...
In the first part of this thesis we generalise the well-known K-terminal reliability R(G,K) to diffe...
We consider the classic problem of NETWORK RELIABILITY. A network is given together with a source ve...
Abstract. Karger (SIAM Journal on Computing, 1999) developed the first fully-polynomial approximatio...
Evaluating the network reliability is an important topic in the planning, designing, and control of ...
13 pages, 10 figures, full version of the paper accepted in WG 2019The parameterized complexity of c...
Evaluating the network reliability is an important topic in the planning, designing, and control of ...