On the public citation graph
Network reliability: Heading out on the highway
0 signed · 252 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199603)27:2<125::aid-net4>3.0.co;2-mopenalex-snapshot
Uniformly least reliable graphs
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199707)29:4<195::aid-net2>3.0.co;2-aopenalex-snapshot
Reliability analysis of replicated and-or graphs
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199708)30:1<37::aid-net5>3.0.co;2-mopenalex-snapshot
Linear time algorithms for computing the most reliable source on an unreliable tree network
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199709)30:2<81::aid-net2>3.0.co;2-gopenalex-snapshot
Exact reliabilities of most reliable double-loop networks
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199712)30:4<231::aid-net1>3.0.co;2-kopenalex-snapshot
The structure of max ?-minm?+1 graphs used in the design of reliable networks
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199712)30:4<293::aid-net6>3.0.co;2-eopenalex-snapshot
(K, j)-domination and (K, j)-reliability
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199803)31:2<61::aid-net1>3.0.co;2-hopenalex-snapshot
Reliability analysis of circulant graphs
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199807)31:4<217::aid-net2>3.0.co;2-gopenalex-snapshot
Uniformly optimally reliable graphs
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199905)33:3<207::aid-net7>3.0.co;2-7openalex-snapshot
The probabilistic longest path problem
inferredcites →https://doi.org/10.1002/(sici)1097-0037(199909)34:2<122::aid-net5>3.0.co;2-popenalex-snapshot
Optimum requirement spanning trees and reliability of tree networks
inferredcites →https://doi.org/10.1002/(sici)1097-0037(200003)35:2<109::aid-net2>3.0.co;2-nopenalex-snapshot
Network reliability with node failures
inferredcites →https://doi.org/10.1002/1097-0037(200101)37:1<1::aid-net1>3.0.co;2-eopenalex-snapshot
The early days ofNetworks
inferredcites →https://doi.org/10.1002/j.1538-7305.1955.tb03799.xopenalex-snapshot
Analysis of Switching Networks
inferredcites →https://doi.org/10.1002/jgt.3190100311openalex-snapshot
On unreliability polynomials and graph connectivity in reliable network synthesis
inferredcites →https://doi.org/10.1002/net.10063openalex-snapshot
A polynomial‐time algorithm to find shortest paths with recourse
inferredcites →https://doi.org/10.1002/net.1975.5.1.45openalex-snapshot
On the Computational Complexity of Combinatorial Problems
inferredcites →https://doi.org/10.1002/net.1975.5.1.97openalex-snapshot
Stochastic Aspects of Networks
inferredcites →https://doi.org/10.1002/net.20051openalex-snapshot
Connectedness of digraphs and graphs under constraints on the conditional diameter
inferredcites →https://doi.org/10.1002/net.20060openalex-snapshot
The strongly connected reliability of complete digraphs
inferredcites →https://doi.org/10.1002/net.20123openalex-snapshot
State‐space partition techniques for multiterminal flows in stochastic networks
inferredcites →https://doi.org/10.1002/net.20124openalex-snapshot
Reliability of interconnection networks modeled by a product of graphs
inferredcites →https://doi.org/10.1002/net.20125openalex-snapshot
Algorithms to calculate the distribution of the longest path length of a stochastic activity network with continuous activity durations
inferredcites →https://doi.org/10.1002/net.20148openalex-snapshot
Uniformly optimal digraphs for strongly connected reliability
inferredcites →https://doi.org/10.1002/net.20186openalex-snapshot
Multiterminal resilience for series‐parallel networks
inferredcites →https://doi.org/10.1002/net.20231openalex-snapshot
Reliability of interconnection networks modeled by Cartesian product digraphs
inferredcites →https://doi.org/10.1002/net.20238openalex-snapshot
Minimizing a stochastic maximum‐reliability path
inferredcites →https://doi.org/10.1002/net.20300openalex-snapshot
A survey of some network reliability analysis and synthesis results
inferredcites →https://doi.org/10.1002/net.20301openalex-snapshot
On the roots of strongly connected reliability polynomials
inferredcites →https://doi.org/10.1002/net.20320openalex-snapshot
The β‐reliable minimax and maximin location problems on a network with probabilistic weights
inferredcites →https://doi.org/10.1002/net.20352openalex-snapshot
The diameter and connectivity of networks with random dependent faults
inferredcites →https://doi.org/10.1002/net.20374openalex-snapshot
A mean‐variance model for the minimum cost flow problem with stochastic arc costs
inferredcites →https://doi.org/10.1002/net.20412openalex-snapshot
High-confidence estimation of small s -t reliabilities in directed acyclic networks
inferredcites →https://doi.org/10.1002/net.20416openalex-snapshot
The most likely path on series‐parallel networks
inferredcites →https://doi.org/10.1002/net.21465openalex-snapshot
Connectedness of finite distance graphs
inferredcites →https://doi.org/10.1002/net.21485openalex-snapshot
Algebraic methods applied to shortest path and maximum flow problems in stochastic networks
inferredcites →https://doi.org/10.1002/net.21530openalex-snapshot
Nonexistence of optimal graphs for all terminal reliability
inferredcites →https://doi.org/10.1002/net.21551openalex-snapshot
Reliability polynomials having arbitrarily many inflection points
inferredcites →https://doi.org/10.1002/net.21578openalex-snapshot
Maximizing lifetime and handling reliability in wireless sensor networks
inferredcites →https://doi.org/10.1002/net.21608openalex-snapshot
On a Random Walk Survivability problem with arc failures and memory
inferredcites →https://doi.org/10.1002/net.21610openalex-snapshot
Stochastic maximum weight forest problem
inferredcites →https://doi.org/10.1002/net.21619openalex-snapshot
Optimal response to epidemics and cyber attacks in networks
inferredcites →https://doi.org/10.1002/net.21634openalex-snapshot
An effective algorithm for computing all‐terminal reliability bounds
inferredcites →https://doi.org/10.1002/net.21654openalex-snapshot
Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior
inferredcites →https://doi.org/10.1002/net.21669openalex-snapshot
Inflection points of reliability polynomials are dense in [0,1]
inferredcites →https://doi.org/10.1002/net.21697openalex-snapshot
On the roots of the node reliability polynomial
inferredcites →https://doi.org/10.1002/net.21727openalex-snapshot
Detecting resilient structures in stochastic networks: A two‐stage stochastic optimization approach
inferredcites →https://doi.org/10.1002/net.21744openalex-snapshot
A recursive formula for the two‐edge connected and biconnected reliability of a complete graph
inferredcites →https://doi.org/10.1002/net.21769openalex-snapshot
Network design with probabilistic capacities
inferredcites →https://doi.org/10.1002/net.21780openalex-snapshot
Factorization and exact evaluation of the source‐terminal diameter‐constrained reliability
inferredcites →https://doi.org/10.1002/net.21811openalex-snapshot
On uniformly most reliable two‐terminal graphs
inferredcites →https://doi.org/10.1002/net.21866openalex-snapshot
The most reliable flight itinerary problem
inferredcites →https://doi.org/10.1002/net.22004openalex-snapshot
Roots of two‐terminal reliability polynomials
inferredcites →https://doi.org/10.1002/net.3230010105openalex-snapshot
Optimal design of centralized computer networks
inferredcites →https://doi.org/10.1002/net.3230010307openalex-snapshot
Network reliability analysis: Part I
inferredcites →https://doi.org/10.1002/net.3230020205openalex-snapshot
Computer communication network design: Experience with theory and practice
inferredcites →https://doi.org/10.1002/net.3230030107openalex-snapshot
Recursive analysis of network reliability
inferredcites →https://doi.org/10.1002/net.3230030304openalex-snapshot
On the design of reliable networks
inferredcites →https://doi.org/10.1002/net.3230040202openalex-snapshot
Exact calculation of computer network reliability
inferredcites →https://doi.org/10.1002/net.3230040303openalex-snapshot
Network properties of the ARPA computer network
inferredcites →https://doi.org/10.1002/net.3230070202openalex-snapshot
Transformations for simplifying network reliability calculations
inferredcites →https://doi.org/10.1002/net.3230070304openalex-snapshot
A fast algorithm for reliability calculations in sparse networks
inferredcites →https://doi.org/10.1002/net.3230070407openalex-snapshot
Bounding distributions for a stochastic pert network
inferredcites →https://doi.org/10.1002/net.3230080307openalex-snapshot
A decomposition algorithm for network reliability analysis
inferredcites →https://doi.org/10.1002/net.3230100105openalex-snapshot
Maximal expected flow in a network subject to arc failures
inferredcites →https://doi.org/10.1002/net.3230100107openalex-snapshot
A theorem concerning cyclic directed graphs with applications to network reliability
inferredcites →https://doi.org/10.1002/net.3230100206openalex-snapshot
Complexity of network reliability computations
inferredcites →https://doi.org/10.1002/net.3230100404openalex-snapshot
A recursive algorithm for finding reliability measures related to the connection of nodes in a graph
inferredcites →https://doi.org/10.1002/net.3230110106openalex-snapshot
Graphs as models of communication network vulnerability: Connectivity and persistence
inferredcites →https://doi.org/10.1002/net.3230110402openalex-snapshot
Series‐parallel reduction for difficult measures of network reliability
inferredcites →https://doi.org/10.1002/net.3230110405openalex-snapshot
Combinatorial properties of directed graphs useful in computing network reliability
inferredcites →https://doi.org/10.1002/net.3230120204openalex-snapshot
On reliability in stochastic graphs
inferredcites →https://doi.org/10.1002/net.3230120304openalex-snapshot
Maximum flow in networks with a small number of random arc capacities
inferredcites →https://doi.org/10.1002/net.3230120305openalex-snapshot
Modular decomposition and reliability computation in stochastic transportation networks having cutnodes
inferredcites →https://doi.org/10.1002/net.3230120408openalex-snapshot
Polynomial algorithms for estimating network reliability
inferredcites →https://doi.org/10.1002/net.3230130107openalex-snapshot
Network reliability and the factoring theorem
inferredcites →https://doi.org/10.1002/net.3230130208openalex-snapshot
A recursive algorithm for directed‐graph reliability
inferredcites →https://doi.org/10.1002/net.3230130210openalex-snapshot
Calculating bounds on reachability and connectedness in stochastic networks
inferredcites →https://doi.org/10.1002/net.3230140307openalex-snapshot
Bounds on expected performance of networks with links subject to failure
inferredcites →https://doi.org/10.1002/net.3230140402openalex-snapshot
Network reliability and acyclic orientations
inferredcites →https://doi.org/10.1002/net.3230140407openalex-snapshot
Note on independence of arcs in antiparallel for network flow problems
inferredcites →https://doi.org/10.1002/net.3230150104openalex-snapshot
The most reliable series‐parallel networks
inferredcites →https://doi.org/10.1002/net.3230150204openalex-snapshot
A factoring algorithm using polygon‐to‐chain reductions for computing K‐terminal network reliability
inferredcites →https://doi.org/10.1002/net.3230150209openalex-snapshot
Network reliability analysis using 2‐connected digraph reductions
inferredcites →https://doi.org/10.1002/net.3230150210openalex-snapshot
Combinatorial optimization problems in the analysis and design of probabilistic networks
inferredcites →https://doi.org/10.1002/net.3230160203openalex-snapshot
Iterative algorithms for generating minimal cutsets in directed graphs
inferredcites →https://doi.org/10.1002/net.3230160208openalex-snapshot
Optimally reliable graphs for both edge and vertex failures
inferredcites →https://doi.org/10.1002/net.3230160303openalex-snapshot
Shortest paths in networks with exponentially distributed arc lengths
inferredcites →https://doi.org/10.1002/net.3230160307openalex-snapshot
First‐and second‐order bounds on terminal reliability
inferredcites →https://doi.org/10.1002/net.3230160404openalex-snapshot
Improving reliability bounds in computer networks
inferredcites →https://doi.org/10.1002/net.3230160406openalex-snapshot
A random network model of message transmission
inferredcites →https://doi.org/10.1002/net.3230160407openalex-snapshot
An algorithm for reliability analysis of planar graphs
inferredcites →https://doi.org/10.1002/net.3230170204openalex-snapshot
A monte carlo sampling plan for estimating reliability parameters and related functions
inferredcites →https://doi.org/10.1002/net.3230170207openalex-snapshot
Node partition formula for directed graph reliability
inferredcites →https://doi.org/10.1002/net.3230180102openalex-snapshot
Bounding all‐terminal reliability in computer networks
inferredcites →https://doi.org/10.1002/net.3230180107openalex-snapshot
On a property of cyclic covers of p‐graphs
inferredcites →https://doi.org/10.1002/net.3230180204openalex-snapshot
Minimal spanning trees in undirected networks with exponentially distributed arc weights
inferredcites →https://doi.org/10.1002/net.3230180206openalex-snapshot
Computational complexity of PERT problems
inferredcites →https://doi.org/10.1002/net.3230180306openalex-snapshot
Stochastic shortest paths with recourse
inferredcites →https://doi.org/10.1002/net.3230190111openalex-snapshot
Domination theory and the crapo β‐invariant
inferredcites →https://doi.org/10.1002/net.3230190203openalex-snapshot
Triconnected decomposition for computing K‐terminal network reliability
inferredcites →https://doi.org/10.1002/net.3230190504openalex-snapshot
Multiplicative improvements in network reliability bounds
inferredcites →https://doi.org/10.1002/net.3230200107openalex-snapshot
Directed network reliability: Domination and computing coefficients of the success‐marginal expansion
inferredcites →https://doi.org/10.1002/net.3230200208openalex-snapshot
Computing the probability distribution of project duration in a PERT network
inferredcites →https://doi.org/10.1002/net.3230200302openalex-snapshot
The probabilistic minimum spanning tree problem
inferredcites →https://doi.org/10.1002/net.3230200303openalex-snapshot
Combining monte carlo estimates and bounds for network reliability
inferredcites →https://doi.org/10.1002/net.3230200402openalex-snapshot
Disjoint (s, t)‐cuts in a network
inferredcites →https://doi.org/10.1002/net.3230200510openalex-snapshot
A randomized approximation algorithm for probabilistic inference on bayesian belief networks
inferredcites →https://doi.org/10.1002/net.3230200603openalex-snapshot
On the construction of optimally reliable graphs
inferredcites →https://doi.org/10.1002/net.3230200706openalex-snapshot
Efficient algorithms for computing the reliability of permutation and interval graphs
inferredcites →https://doi.org/10.1002/net.3230210204openalex-snapshot
On the existence of uniformly optimally reliable networks
inferredcites →https://doi.org/10.1002/net.3230210305openalex-snapshot
Resilience of partial k ‐tree networks with edge and node failures
inferredcites →https://doi.org/10.1002/net.3230210307openalex-snapshot
On the nonexistence of uniformly optimal graphs for pair‐connected reliability
inferredcites →https://doi.org/10.1002/net.3230210404openalex-snapshot
Uniformly‐most reliable networks do not always exist
inferredcites →https://doi.org/10.1002/net.3230210504openalex-snapshot
On dependence and reliability computations
inferredcites →https://doi.org/10.1002/net.3230210507openalex-snapshot
Computing rooted communication reliability in an almost acyclic digraph
inferredcites →https://doi.org/10.1002/net.3230210604openalex-snapshot
Maximum flows in probabilistic networks
inferredcites →https://doi.org/10.1002/net.3230210706openalex-snapshot
Characterizing stochastic flow networks using the monte carlo method
inferredcites →https://doi.org/10.1002/net.3230220206openalex-snapshot
A reliability‐improving graph transformation with applications to network reliability
inferredcites →https://doi.org/10.1002/net.3230220405openalex-snapshot
Algorithms for K‐terminal reliability problems with node failures
inferredcites →https://doi.org/10.1002/net.3230230103openalex-snapshot
Network transformations and bounding network reliability
inferredcites →https://doi.org/10.1002/net.3230230302openalex-snapshot
On the star—delta transformation in network reliability
inferredcites →https://doi.org/10.1002/net.3230230305openalex-snapshot
Shortest paths in stochastic networks with ARC lengths having discrete distributions
inferredcites →https://doi.org/10.1002/net.3230230306openalex-snapshot
On uniformly optimally reliable graphs for pair‐connected reliability with vertex failures
inferredcites →https://doi.org/10.1002/net.3230230411openalex-snapshot
Renormalization of two—terminal reliability
inferredcites →https://doi.org/10.1002/net.3230230415openalex-snapshot
Optimization of the reliability polynomial in presence of mediocre elements
inferredcites →https://doi.org/10.1002/net.3230230422openalex-snapshot
Reliability evaluation and decision problems in extra stage shuffle‐exchange MINs
inferredcites →https://doi.org/10.1002/net.3230230502openalex-snapshot
Most reliable double loop networks in survival reliability
inferredcites →https://doi.org/10.1002/net.3230230704openalex-snapshot
Sensitivity analysis in stochastic flow networks using the Monte Carlo method
inferredcites →https://doi.org/10.1002/net.3230230805openalex-snapshot
On stochastic spanning tree problem
inferredcites →https://doi.org/10.1002/net.3230240407openalex-snapshot
On reliability of graphs with node failures
inferredcites →https://doi.org/10.1002/net.3230240504openalex-snapshot
A proof of Boesch's conjecture
inferredcites →https://doi.org/10.1002/net.3230250304openalex-snapshot
Threshold reliability of networks with small failure sets
inferredcites →https://doi.org/10.1002/net.3230250305openalex-snapshot
Monte Carlo and Markov Chain techniques for network reliability and sampling
inferredcites →https://doi.org/10.1002/net.3230250307openalex-snapshot
A forbidden minor characterization and reliability of a class of partial 4‐trees
inferredcites →https://doi.org/10.1002/net.3230250309openalex-snapshot
Consecutive cuts and paths, and bounds onk‐terminal reliability
inferredcites →https://doi.org/10.1002/net.3230260402openalex-snapshot
The intractability of the reliable assignment problem in split networks
inferredcites →https://doi.org/10.1002/net.3230260406openalex-snapshot
Reliability analysis of tree‐based networks and its application to fault‐tolerant VLSI systems
inferredcites →https://doi.org/10.1007/978-1-4612-1384-0_1openalex-snapshot
Reliability: Past, Present, Future
inferredcites →https://doi.org/10.1007/978-3-642-22374-7openalex-snapshot
Network Reliability and Resilience
inferredcites →https://doi.org/10.1007/bf01171114openalex-snapshot
Ein Satz �ber Untermengen einer endlichen Menge
inferredcites →https://doi.org/10.1007/bf01904874openalex-snapshot
On graphs with randomly deleted edges
inferredcites →https://doi.org/10.1007/s00208-011-0777-6openalex-snapshot
Log-concavity of characteristic polynomials and the Bergman fan of matroids
inferredcites →https://doi.org/10.1007/s11235-013-9820-0openalex-snapshot
Inflection points for network reliability
inferredcites →https://doi.org/10.1007/s11786-018-0345-5openalex-snapshot
Sixty Years of Network Reliability
inferredcites →https://doi.org/10.1016/0016-0032(56)90044-8openalex-snapshot
Reliable circuits using less reliable relays
inferredcites →https://doi.org/10.1016/0026-2714(69)90018-3openalex-snapshot
Probabilistic reliability: An engineering approach
inferredcites →https://doi.org/10.1016/0166-218x(92)90153-2openalex-snapshot
Generating the states of a binary stochastic system
inferredcites →https://doi.org/10.1016/0885-064x(85)90021-4openalex-snapshot
Monte-Carlo algorithms for the planar multiterminal network reliability problem
inferredcites →https://doi.org/10.1016/j.aam.2013.07.001openalex-snapshot
The f-vector of a representable-matroid complex is log-concave
inferredcites →https://doi.org/10.1016/j.aim.2014.11.002openalex-snapshot
h-Vectors of matroids and logarithmic concavity
inferredcites →https://doi.org/10.1016/j.aim.2019.106840openalex-snapshot
Central limit theorems from the roots of probability generating functions
inferredcites →https://doi.org/10.1016/j.dam.2014.05.048openalex-snapshot
The average reliability of a graph
inferredcites →https://doi.org/10.1016/j.dam.2017.11.035openalex-snapshot
The shape of node reliability
inferredcites →https://doi.org/10.1016/j.dam.2019.04.022openalex-snapshot
Classes of uniformly most reliable graphs for all-terminal reliability
inferredcites →https://doi.org/10.1016/j.disc.2009.03.012openalex-snapshot
The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane
inferredcites →https://doi.org/10.1016/j.disc.2017.01.024openalex-snapshot
On the roots of all-terminal reliability polynomials
inferredcites →https://doi.org/10.1016/j.disc.2017.10.007openalex-snapshot
On the unimodality of independence polynomials of very well-covered graphs
inferredcites →https://doi.org/10.1016/j.disc.2019.05.002openalex-snapshot
On the reliability roots of simplicial complexes and matroids
inferredcites →https://doi.org/10.1016/j.disopt.2009.05.003openalex-snapshot
Chip firing and all-terminal network reliability bounds
inferredcites →https://doi.org/10.1016/j.ejc.2010.08.003openalex-snapshot
On the unimodality of independence polynomials of some graphs
inferredcites →https://doi.org/10.1016/j.jctb.2004.03.008openalex-snapshot
The Brown–Colbourn conjecture on zeros of reliability polynomials is false
inferredcites →https://doi.org/10.1016/j.jctb.2006.06.001openalex-snapshot
The roots of the independence polynomial of a clawfree graph
inferredcites →https://doi.org/10.1016/s0095-8956(02)00014-xopenalex-snapshot
The independence fractal of a graph
inferredcites →https://doi.org/10.1017/s0963548300004612openalex-snapshot
Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
inferredcites →https://doi.org/10.1017/s0963548399004162openalex-snapshot
Zeros of Reliability Polynomials and f-vectors of Matroids
inferredcites →https://doi.org/10.1023/a:1024663508526openalex-snapshot
Reliability Polynomials and Their Asymptotic Limits for Families of Graphs
inferredcites →https://doi.org/10.1080/00029890.1965.11970533openalex-snapshot
Best Possible Inequalities for the Probability of a Logical Function of Events
inferredcites →https://doi.org/10.1080/00401706.1961.10489927openalex-snapshot
Multi-Component Systems and Structures and Their Reliability
inferredcites →https://doi.org/10.1080/00401706.1963.10490074openalex-snapshot
Relationship Between System Failure Rate and Component Failure Rates
inferredcites →https://doi.org/10.1080/00401706.1963.10490075openalex-snapshot
Coherent Structures of Non-Identical Components
inferredcites →https://doi.org/10.1080/00401706.1970.10488672openalex-snapshot
Approximations to System Reliability Using a Modular Decomposition
inferredcites →https://doi.org/10.1080/00401706.1977.10489566openalex-snapshot
Reliability and Fault Tree Analysis
inferredcites →https://doi.org/10.1080/01621459.1976.10480949openalex-snapshot
Science and Statistics
inferredcites →https://doi.org/10.1090/pspum/050/1067764openalex-snapshot
Developments in “The synthesis of reliable organisms from unreliable components”
inferredcites →https://doi.org/10.1093/oso/9780198533863.001.0001openalex-snapshot
Network Reliability and Algebraic Structures
inferredcites →https://doi.org/10.1109/26.61483openalex-snapshot
Least reliable networks and the reliability domination
inferredcites →https://doi.org/10.1109/rams.2004.1285431openalex-snapshot
Pioneers of the reliability theories of the past 50 years
inferredcites →https://doi.org/10.1109/tce.1958.6372698openalex-snapshot
The analysis of redundancy networks
inferredcites →https://doi.org/10.1109/tcom.1972.1091159openalex-snapshot
A Fast Recursive Algorithm to Calculate the Reliability of a Communication Network
inferredcites →https://doi.org/10.1109/tct.1959.1086604openalex-snapshot
Reliability of a Physical System
inferredcites →https://doi.org/10.1109/tct.1965.1082452openalex-snapshot
Probabilistic Flows Through a Communication Network
inferredcites →https://doi.org/10.1109/tct.1969.1082978openalex-snapshot
Synthesis of Reliable Networks
inferredcites →https://doi.org/10.1109/tr.1967.5217462openalex-snapshot
A Monte Carlo Technique for Obtaining System Reliability Confidence Limits from Component Test Data
inferredcites →https://doi.org/10.1109/tr.1969.5216346openalex-snapshot
An Algorithm to Determine the Reliability of a Complex System
inferredcites →https://doi.org/10.1109/tr.1970.5216391openalex-snapshot
A Computer Program for Approximating System Reliability
inferredcites →https://doi.org/10.1109/tr.1971.5216111openalex-snapshot
A Computerized Algorithm for Determining the Reliability of Redundant Configurations
inferredcites →https://doi.org/10.1109/tr.1986.4335424openalex-snapshot
Synthesis of reliable networks - a survey
inferredcites →https://doi.org/10.1111/j.1749-6632.1989.tb16434.xopenalex-snapshot
Log‐Concave and Unimodal Sequences in Algebra, Combinatorics, and Geometry a
inferredcites →https://doi.org/10.1137/0110035openalex-snapshot
A Note on the Reliability of Communication Networks
inferredcites →https://doi.org/10.1137/0111058openalex-snapshot
Wye-Delta Transformation in Probablilistic Networks
inferredcites →https://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferredcites →https://doi.org/10.1137/0212053openalex-snapshot
The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
inferredcites →https://doi.org/10.1137/0603016openalex-snapshot
Bounds on the Reliability Polynomial for Shellable Independence Systems
inferredcites →https://doi.org/10.1137/0608022openalex-snapshot
Algebraic Methods Applied to Network Reliability Problems
inferredcites →https://doi.org/10.1137/1114052openalex-snapshot
Combinatorial Algebra and Random Graphs
inferredcites →https://doi.org/10.1137/s089548019732180xopenalex-snapshot
Boolean Normal Forms, Shellability, and Reliability Computations
showing the first 200 of 212 · page through all 212
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/asmb.2893openalex-snapshot
Limiting Behavior of Mixed Coherent Systems With Lévy‐Frailty Marshall–Olkin Failure Times
inferred← citeshttps://doi.org/10.1002/net.22085openalex-snapshot
Uniformly optimally reliable graphs: A survey
inferred← citeshttps://doi.org/10.1002/net.22089openalex-snapshot
Exact reliability optimization for series‐parallel graphs using convex envelopes
inferred← citeshttps://doi.org/10.1002/net.22141openalex-snapshot
More reliable graphs are not always stronger
inferred← citeshttps://doi.org/10.1002/net.22150openalex-snapshot
Existence of optimally‐greatest digraphs for strongly connected node reliability
inferred← citeshttps://doi.org/10.1002/net.22215openalex-snapshot
New approximations for network reliability
inferred← citeshttps://doi.org/10.1002/net.22239openalex-snapshot
A new linear path pair availability constraint for network design
inferred← citeshttps://doi.org/10.1002/net.70022openalex-snapshot
Infinitely Many Counterexamples to Conjectures by Boesch and Ath‐Sobel
inferred← citeshttps://doi.org/10.1007/978-3-031-16684-6_33openalex-snapshot
Bridging Reliability to Efficiency Consecutive Elegant and Simple Design
inferred← citeshttps://doi.org/10.1007/978-3-031-16684-6_34openalex-snapshot
On the Roots of Certain Reliability Polynomials
inferred← citeshttps://doi.org/10.1007/978-3-031-16684-6_37openalex-snapshot
Green AI from Kirchhoff to Shannon
inferred← citeshttps://doi.org/10.1007/978-3-031-23636-5_53openalex-snapshot
Consecutive Systems Asymptotic Threshold Behaviors
inferred← citeshttps://doi.org/10.1007/s10955-025-03457-2openalex-snapshot
Exact Potts/Tutte Polynomials for Hammock Chain Graphs
inferred← citeshttps://doi.org/10.1016/j.comnet.2025.111278openalex-snapshot
Trust-based fog-blockchain model for scalable authentication in smart cities
inferred← citeshttps://doi.org/10.1016/j.dam.2022.02.002openalex-snapshot
Maximal intervals of decrease and inflection points for node reliability
inferred← citeshttps://doi.org/10.1016/j.dam.2023.06.018openalex-snapshot
On maximum graphs in Tutte polynomial posets
inferred← citeshttps://doi.org/10.1016/j.jocs.2025.102657openalex-snapshot
Unique analytical scheme for Fokker-Planck equation by the Matching polynomials of complete graph
inferred← citeshttps://doi.org/10.1016/j.ress.2022.108427openalex-snapshot
Road networks reliability estimations and optimizations: A Bi-directional bottom-up, top-down approach
inferred← citeshttps://doi.org/10.1016/j.ress.2025.112121openalex-snapshot
Computing the reliability of hammock networks in quadratic time with respect to length
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.025openalex-snapshot
Nonexistence of uniformly most reliable two-terminal graphs
inferred← citeshttps://doi.org/10.1017/s0269964820000534openalex-snapshot
MARKOV CHAIN METHOD FOR COMPUTING THE RELIABILITY OF HAMMOCK NETWORKS
inferred← citeshttps://doi.org/10.1093/comnet/cnaf001openalex-snapshot
Degree-based approximations for network reliability polynomials
inferred← citeshttps://doi.org/10.1109/access.2023.3255794openalex-snapshot
Communication Network Reliability Under Geographically Correlated Failures Using Probabilistic Seismic Hazard Analysis
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206704openalex-snapshot
Fast Methods for Ranking Synthetic BECs
inferred← citeshttps://doi.org/10.1109/tnsm.2025.3607004openalex-snapshot
Node-Reliability: Monte Carlo, Laplace, and Stochastic Approximations and a Greedy Link-Augmentation Strategy
inferred← citeshttps://doi.org/10.1109/tr.2024.3353908openalex-snapshot
Which Coefficients Matter Most—Consecutive $k$-Out-of-$n$:$F$ Systems Revisited
inferred← citeshttps://doi.org/10.1177/1748006x231183196openalex-snapshot
System reliability evaluation and dynamic optimization based on an improved reliability block diagram
inferred← citeshttps://doi.org/10.15837/ijccc.2022.4.4865openalex-snapshot
Approximating the Level Curves on Pascal’s Surface
inferred← citeshttps://doi.org/10.1609/aaai.v36i9.21271openalex-snapshot
Search Strategies for Topological Network Optimization
inferred← citeshttps://doi.org/10.3390/app152211867openalex-snapshot
Uncertainty-Driven Reliability Analysis Using Importance Measures and Risk Priority Numbers
inferred← citeshttps://doi.org/10.3390/math11204252openalex-snapshot
The Roots of the Reliability Polynomials of Circular Consecutive-k-out-of-n:F Systems
inferred← citeshttps://doi.org/10.3390/math9243182openalex-snapshot
Generalized Convexity Properties and Shape-Based Approximation in Networks Reliability
inferred← citeshttps://doi.org/10.3390/sym14020411openalex-snapshot
On a Surface Associated with Pascal’s Triangle
inferred← citeshttps://doi.org/10.3390/systems12010031openalex-snapshot
Complex Network-Based Resilience Capability Assessment for a Combat System of Systems
inferred← citeshttps://doi.org/10.3390/systems14091172openalex-snapshot
Resilience Metric and Enhancement for Adversarial Operational Loop Networks via Reinforcement Learning
inferred← citeshttps://doi.org/10.36227/techrxiv.20954647openalex-snapshot
Communication Network Reliability under geographically correlated failures using Probabilistic Seismic Hazard Analysis
inferred← citeshttps://doi.org/10.36227/techrxiv.20954647.v1openalex-snapshot
Communication Network Reliability under geographically correlated failures using Probabilistic Seismic Hazard Analysis
inferred← citeshttps://doi.org/10.36227/techrxiv.20954647.v2openalex-snapshot
Communication Network Reliability under geographically correlated failures using Probabilistic Seismic Hazard Analysis
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.