Paper Info
Title
Resolving the Network Reliability Problem with a Tree Decomposition of the Graph
Abstract
In this paper is given a method to resolve the network reliability problem. This dynamicmethod need a tree decomposition of the graph, with a small treewidth, and allows toresolve the network reliability problem in linear time. First, the paper explains the treedecomposition and its important properties and then the method is explained with anexample of resolution for the all terminal reliability with perfect vertices.Keywords: tree decomposition, treewidth, network reliability, dynamic...
Year
Venue
Keywords
1997
OPODIS
linear time,tree decomposition,network reliability
Field
DocType
Citations 
Mathematical optimization,Tree traversal,Computer science,Tree decomposition,Algorithm,Decomposition method (constraint satisfaction),Order statistic tree,Hypertree network,Treewidth,Time complexity,Gomory–Hu tree,Distributed computing
Conference
1
PageRank 
References 
Authors
0.35
11
2
Name
Order
Citations
PageRank
Jean-francois Manouvrier150.97
Corinne Lucet2998.51