scientific article

Publication date: 17 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

connectedness graph theory partial orders network reliability algebraic structures symbolic manipulations Pseudopolynomial algorithms State-space approximation Stochastic shortest-path problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Applications of graph theory to circuits and networks (94C15)

Related Items (41)

Sixty years of network reliability ⋮ A cutting plane algorithm for computing \(k\)-edge survivability of a network ⋮ Monomial ideals and the Scarf complex for coherent systems in reliability theory. ⋮ Renormalization of two—terminal reliability ⋮ Fast computation of bounds for two-terminal network reliability ⋮ A DIVIDE-AND-CONQUER ALGORITHM FOR FINDING A MOST RELIABLE SOURCE ON A RING-EMBEDDED TREE NETWORK WITH UNRELIABLE EDGES ⋮ Unnamed Item ⋮ Algebraic methods applied to shortest path and maximum flow problems in stochastic networks ⋮ On reliability of graphs with node failures ⋮ A survey of efficient reliability computation using disjoint products approach ⋮ Consecutive cuts and paths, and bounds on k‐terminal reliability ⋮ Network connectivity entropy and its application on network connectivity reliability ⋮ Network reliability: Heading out on the highway ⋮ Factorization of network reliability with perfect nodes. I: Introduction and statements ⋮ Factorization of network reliability with perfect nodes. II: Connectivity matrix ⋮ Measuring component importance for network system using cellular automata ⋮ Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay ⋮ Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach ⋮ A quick inclusion-exclusion technique ⋮ Availability allocation of networked systems using Markov model and heuristics algorithm ⋮ Expected rank in antimatroids ⋮ Polynomial‐time algorithms for solving a class of critical node problems on trees and series‐parallel graphs ⋮ Network location of a reliable center using the most reliable route policy ⋮ A novel node-based sequential implicit enumeration method for finding all \(d\)-MPs in a multistate flow network ⋮ A note on Zeilberger's abstract lace expansion ⋮ Unnamed Item ⋮ On the inference of semi-coherent structures from data ⋮ The graph bottleneck identity ⋮ An improved algorithm for finding all upper boundary points in a stochastic-flow network ⋮ Expected value expansions in rooted graphs ⋮ A linear time algorithm for computing the most reliable source on a series--parallel graph with unreliable edges ⋮ Structured construction and simulation of nondeterministic stochastic activity networks ⋮ Unnamed Item ⋮ A Note on the Recognition of Nested Graphs ⋮ Uniformly optimal graphs in some classes of graphs with node failures ⋮ An Edge-Turbulence Algorithm for the 2-MRS Problem on Trees with Unreliable Edges ⋮ Algorithms to calculate the distribution of the longest path length of a stochastic activity network with continuous activity durations ⋮ Improved Bonferroni inequalities via union-closed set systems ⋮ Accurate and Interval Estimates of the Probability of Network Service Availability for Communication Networks ⋮ Nested Graphs ⋮ On algorithms for enumerating BC-subtrees of unicyclic and edge-disjoint bicyclic graphs

This page was built for publication: