The Complexity of Reliability Computations in Planar and Acyclic Graphs
From MaRDI portal
Recommendations
Cited in
(36)- Network reliability and the probabilistic estimation of damage from fire spread
- Invulnerability of planar two-tree networks
- A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges
- On sampling simple paths in planar graphs according to their lengths
- Sixty years of network reliability
- Computational complexity of impact size estimation for spreading processes on networks
- A graph theoretical approach to the firebreak locating problem
- scientific article; zbMATH DE number 176146 (Why is no real title available?)
- The computational complexity of the reliability problem on distributed systems
- A survey of some network reliability analysis and synthesis results
- An algorithm to compute the all-terminal reliability measure.
- scientific article; zbMATH DE number 1337741 (Why is no real title available?)
- scientific article; zbMATH DE number 1396593 (Why is no real title available?)
- Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula
- Tutte polynomials computable in polynomial time
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
- Measuring the distance to series-parallelity by path expressions
- Reliability Computations for Planar Networks
- A factoring approach for the stochastic shortest path problem
- scientific article; zbMATH DE number 4187439 (Why is no real title available?)
- High-confidence estimation of small s-t reliabilities in directed acyclic networks
- Computing residual connectedness reliability for restricted networks
- A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks
- The complexity of the reliable connectivity problem
- An FPRAS for two terminal reliability in directed acyclic graphs
- Combinatorial aspects of network reliability
- The distributed program reliability analysis on ring-type topologies
- About the infinite windy firebreak location problem
- MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKS
- Renewal Networks: Connectivity and Reachability on a Time Interval
- Universal graph model of cyclic networks and their reliability
- Network reliability: Numbers or insight? (A discussion paper)
- Computing optimal assignments for residual network reliability
- On the computational complexity of the Jones and Tutte polynomials
- Computing the \(K\)-terminal reliability of directed path graphs
- Network Resilience
This page was built for publication: The Complexity of Reliability Computations in Planar and Acyclic Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3745304)
