Pages that link to "Item:Q3335483"
From MaRDI portal
The following pages link to An <i>O</i>(|<i>E</i>|) Time Algorithm for Computing the Reliability of a Class of Directed Networks (Q3335483):
Displaying 12 items.
- A linear time algorithm for computing a most reliable source on a tree network with faulty nodes (Q621840) (← links)
- Reliable assignments of processors to tasks and factoring on matroids (Q685664) (← links)
- Parametric max flow problems in a class of networks with series-parallel structure (Q1332816) (← links)
- A note on integral generalized flows in directed partial 2-trees (Q2234778) (← links)
- Computing the \(K\)-terminal reliability of directed path graphs (Q2348708) (← links)
- Computation of the Reconstruction Probability of Secret Sharing Schemes based on the K-terminal Reliability (Q3438991) (← links)
- Network reliability analysis using 2-connected digraph reductions (Q3712105) (← links)
- Algebraic Methods Applied to Network Reliability Problems (Q3758857) (← links)
- Computing rooted communication reliability in an almost acyclic digraph (Q3978609) (← links)
- Reliability analysis of replicated and-or graphs (Q4347272) (← links)
- An O(n*log(n)) algorithm to compute the all-terminal reliability of (K/sub 5/, K/sub 2.2.2/) free networks (Q5288661) (← links)
- Measuring the distance to series-parallelity by path expressions (Q6184376) (← links)
