On the public citation graph

Improving the Kuo-Lu-Yeh Algorithm for Assessing Two-Terminal Reliability

0 signed · 36 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/net.3230130107openalex-snapshot
Network reliability and the factoring theorem
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.1007/11533719_45openalex-snapshot
Efficient and Simple Generation of Random Simple Connected Graphs with Prescribed Degree Sequence
inferredcites →https://doi.org/10.1016/0026-2714(95)00087-9openalex-snapshot
Terminal reliability using binary decision diagrams
inferredcites →https://doi.org/10.1016/0951-8320(93)90060-copenalex-snapshot
New algorithms for fault trees analysis
inferredcites →https://doi.org/10.1016/j.entcs.2012.11.015openalex-snapshot
A Memory-efficient Bounding Algorithm for the Two-terminal Reliability Problem
inferredcites →https://doi.org/10.1109/12.53586openalex-snapshot
Finding the optimal variable ordering for binary decision diagrams
inferredcites →https://doi.org/10.1109/24.210267openalex-snapshot
Experimental results on preprocessing of path/cut terms in sim of disjoint products technique
inferredcites →https://doi.org/10.1109/24.257782openalex-snapshot
Parallel algorithms for terminal-pair reliability
inferredcites →https://doi.org/10.1109/24.52639openalex-snapshot
An improved minimizing algorithm for sum of disjoint products (reliability theory)
inferredcites →https://doi.org/10.1109/24.536994openalex-snapshot
A cut-based method for terminal-pair reliability
inferredcites →https://doi.org/10.1109/24.799845openalex-snapshot
Determining terminal-pair reliability based on edge expansion diagrams using OBDD
inferredcites →https://doi.org/10.1109/24.87131openalex-snapshot
Factoring and reductions for networks with imperfect vertices
inferredcites →https://doi.org/10.1109/infcom.1991.147550openalex-snapshot
Experimental results on preprocessing of path/cut terms in sum of disjoint products technique
inferredcites →https://doi.org/10.1109/tc.1978.1675141openalex-snapshot
Binary Decision Diagrams
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1109/tcs.1979.1084573openalex-snapshot
A new analysis technique for probabilistic graphs
inferredcites →https://doi.org/10.1109/tr.1986.4335422openalex-snapshot
Computational Complexity of Network Reliability Analysis: An Overview
inferredcites →https://doi.org/10.1109/tr.2002.804736openalex-snapshot
OBDD-based evaluation of k-terminal network reliability
inferredcites →https://doi.org/10.1109/tr.2007.896770openalex-snapshot
Efficient and Exact Reliability Evaluation for Networks With Imperfect Vertices
inferredcites →https://doi.org/10.1109/tr.2007.898572openalex-snapshot
K-Terminal Network Reliability Measures With Binary Decision Diagrams
inferredcites →https://doi.org/10.1137/0132031openalex-snapshot
Computing the Reliability of Complex Networks
inferredcites →https://doi.org/10.1145/136035.136043openalex-snapshot
Symbolic Boolean manipulation with ordered binary-decision diagrams
inferredcites →https://doi.org/10.1145/362248.362272openalex-snapshot
Algorithm 447: efficient algorithms for graph manipulation
inferredcites →https://doi.org/10.1243/1748006xjrr139openalex-snapshot
Efficient extraction of the structure formula from reliability block diagrams with dependent basic events
inferredcites →https://doi.org/10.48550/arxiv.0807.0626openalex-snapshot
Asymptotic Mean Time To Failure and Higher Moments for Large, Recursive Networks

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/qre.1937openalex-snapshot
A Parallel Strategy for the Logical‐probabilistic Calculus‐based Method to Calculate Two‐terminal Reliability
inferred← citeshttps://doi.org/10.1002/qre.3127openalex-snapshot
Reliability analysis for command‐and‐control systems based on edge extension diagram and binary decision diagram
inferred← citeshttps://doi.org/10.1016/j.ress.2019.03.026openalex-snapshot
Efficient construction of binary decision diagrams for network reliability with imperfect vertices
inferred← citeshttps://doi.org/10.1109/dsn.2014.55openalex-snapshot
A Novel Variable Ordering Heuristic for BDD-based K-Terminal Reliability
inferred← citeshttps://doi.org/10.1109/icaccaf.2017.8344710openalex-snapshot
Reliability calculation in arbitrary topology of communication network
inferred← citeshttps://doi.org/10.1109/infocom.2018.8485859openalex-snapshot
Optimizing Network Reliability via Best-First Search over Decision Diagrams
inferred← citeshttps://doi.org/10.1109/tr.2018.2877775openalex-snapshot
Reliability Analysis for Disjoint Paths
inferred← citeshttps://doi.org/10.11591/ijeecs.v21.i2.pp1185-1192openalex-snapshot
Hybrid algorithm for two-terminal reliability evaluation in communication networks
inferred← citeshttps://doi.org/10.1587/transcom.2019ebp3119openalex-snapshot
Efficient Reliability Evaluation of Multi-Domain Networks with Secure Intra-Domain Privacy
inferred← citeshttps://doi.org/10.23919/acc53348.2022.9867462openalex-snapshot
Optimal Partial Observation for Estimating Network Connectivity
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.