On powers of m-trapezoid graphs
Discrete Applied Mathematics
Treewidth and Pathwidth of Permutation Graphs
SIAM Journal on Discrete Mathematics
Data Communications Computer Networks and Open Systems 3rd Ed.
Data Communications Computer Networks and Open Systems 3rd Ed.
Fundamentals of Data Structures in C
Fundamentals of Data Structures in C
| Hi-index | 0.89 |
Consider a probabilistic graph in which the edges are perfectly reliable, but vertices may fail with some known probabilities. The K-terminal reliability of this graph is the probability that a given set of vertices K are connected to each other. This reliability problem is known to be #P-complete for general graphs, and it remains #P-complete for chordal graphs and comparability graphs. This work proposes an O(n^2^d^+^1)-time algorithm for computing the K-terminal reliability of d-trapezoid graphs. With some modifications, the algorithm is executed in O(n^2) time for interval graphs.