On the public citation graph
A cut-based method for terminal-pair reliability
0 signed · 50 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.1109/24.326428openalex-snapshot
Calculation of node-pair reliability in large networks with unreliable nodes
inferredcites →https://doi.org/10.1109/24.3743openalex-snapshot
A comparison of algorithms for terminal-pair reliability
inferredcites →https://doi.org/10.1109/71.89065openalex-snapshot
CAREL: computer aided reliability evaluator for distributed computing networks
inferredcites →https://doi.org/10.1109/milcom.1991.258231openalex-snapshot
An efficient algorithm for the calculation of node-pair reliability
inferredcites →https://doi.org/10.1109/tcs.1979.1084573openalex-snapshot
A new analysis technique for probabilistic graphs
inferredcites →https://doi.org/10.1109/tr.1979.5220476openalex-snapshot
An Improved Algorithm for Network Reliability
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.1987.5222290openalex-snapshot
Recursive Technique For Computing System Reliability
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.1772openalex-snapshot
Enumeration of Minimal Cutsets for Directed Networks with Comparative Reliability Study for Paths or Cuts
inferred← citeshttps://doi.org/10.1007/978-3-642-28540-0_3openalex-snapshot
Bounds for Two-Terminal Network Reliability with Dependent Basic Events
inferred← citeshttps://doi.org/10.1007/s11803-012-0093-5openalex-snapshot
An improved cut-based recursive decomposition algorithm for reliability analysis of networks
inferred← citeshttps://doi.org/10.1016/j.camwa.2010.09.033openalex-snapshot
A practical bounding algorithm for computing two-terminal reliability based on decomposition technique
inferred← citeshttps://doi.org/10.1016/j.comcom.2021.02.004openalex-snapshot
System reliability evaluation using budget constrained real d -MC search
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.11.015openalex-snapshot
A Memory-efficient Bounding Algorithm for the Two-terminal Reliability Problem
inferred← citeshttps://doi.org/10.1016/j.epsr.2009.04.005openalex-snapshot
Evaluating multiple reliability indices of regional networks in wide area measurement system
inferred← citeshttps://doi.org/10.1016/j.microrel.2013.08.001openalex-snapshot
Reliability and lifetime modeling of wireless sensor nodes
inferred← citeshttps://doi.org/10.1016/j.ress.2005.11.006openalex-snapshot
Improving efficiency of solving d-MC problem in stochastic-flow network
inferred← citeshttps://doi.org/10.1016/s0164-1212(01)00023-1openalex-snapshot
Minimizing the mean delay of quorum-based mutual exclusion schemes
inferred← citeshttps://doi.org/10.1016/s0898-1221(00)00166-8openalex-snapshot
A network reduction axion for efficient computation of terminal-pair reliability
inferred← citeshttps://doi.org/10.1016/s0898-1221(00)00204-2openalex-snapshot
Terminal-pair reliability in ATM virtual path networks
inferred← citeshttps://doi.org/10.1016/s0951-8320(98)00096-9openalex-snapshot
Cutset enumeration of network systems with link and node failures
inferred← citeshttps://doi.org/10.1093/comjnl/42.7.613openalex-snapshot
Availability Evaluation of Quorum-Based Mutual Exclusion Schemes in General Topology Networks
inferred← citeshttps://doi.org/10.1109/24.799845openalex-snapshot
Determining terminal-pair reliability based on edge expansion diagrams using OBDD
inferred← citeshttps://doi.org/10.1109/24.935023openalex-snapshot
Efficient computation of marginal reliability-importance for reducible/sup +/ networks
inferred← citeshttps://doi.org/10.1109/71.762814openalex-snapshot
Minimizing the maximum delay for reaching consensus in quorum-based mutual exclusion schemes
inferred← citeshttps://doi.org/10.1109/71.993209openalex-snapshot
Matching and scheduling algorithms for minimizing execution time and failure probability of applications in heterogeneous computing
inferred← citeshttps://doi.org/10.1109/ants.2010.5983504openalex-snapshot
The reliability of the interconnection networks through self generating disjoint minimal cut-set method
inferred← citeshttps://doi.org/10.1109/ares.2011.91openalex-snapshot
Considering Dependent Components in the Terminal Pair Reliability Problem
inferred← citeshttps://doi.org/10.1109/cmpsac.2003.1245367openalex-snapshot
A cut-based algorithm for reliability analysis of terminal-pair network using OBDD
inferred← citeshttps://doi.org/10.1109/dsn.2004.1311904openalex-snapshot
A bi-criteria scheduling heuristic for distributed embedded systems under reliability and real-time constraints
inferred← citeshttps://doi.org/10.1109/edcc.2014.11openalex-snapshot
Improving the Kuo-Lu-Yeh Algorithm for Assessing Two-Terminal Reliability
inferred← citeshttps://doi.org/10.1109/energycon.2012.6348288openalex-snapshot
A systematic approach for calculating reliability of substation automation system functions
inferred← citeshttps://doi.org/10.1109/icc.1998.682686openalex-snapshot
Efficient computation of terminal-pair reliability using triangle reduction in network management
inferred← citeshttps://doi.org/10.1109/icc.1999.765431openalex-snapshot
Efficient computation of marginal reliability importance for reducible/sup +/ networks in network management
inferred← citeshttps://doi.org/10.1109/icecs.2000.912972openalex-snapshot
A new approach for enumerating minimal cut-sets in a network
inferred← citeshttps://doi.org/10.1109/icnc.2015.7377974openalex-snapshot
Reliability evaluation of intelligent manufacturing equipment
inferred← citeshttps://doi.org/10.1109/icpp.2000.876146openalex-snapshot
Reliable matching and scheduling of precedence-constrained tasks in heterogeneous distributed computing
inferred← citeshttps://doi.org/10.1109/naps.2017.8107279openalex-snapshot
Worst-case reliability modeling and evaluation in cyber-enabled power distribution systems
inferred← citeshttps://doi.org/10.1109/prfts.1997.640131openalex-snapshot
Hierarchical modeling and dependability evaluation of distributed systems
inferred← citeshttps://doi.org/10.1109/spcom.2010.5560528openalex-snapshot
A self generating disjoint minimal cut-set method for evaluating the reliability of interconnection networks
inferred← citeshttps://doi.org/10.1109/tr.2006.884595openalex-snapshot
Circular Layout Cutsets: An Approach for Improving Consecutive Cutset Bounds for Network Reliability
inferred← citeshttps://doi.org/10.1109/tr.2007.896770openalex-snapshot
Efficient and Exact Reliability Evaluation for Networks With Imperfect Vertices
inferred← citeshttps://doi.org/10.1109/tr.2008.2006293openalex-snapshot
A Fast Algorithm for Searching All Multi-State Minimal Cuts
inferred← citeshttps://doi.org/10.1109/tr.2009.2028090openalex-snapshot
A Cutsets-Based Unified Framework to Evaluate Network Reliability Measures
inferred← citeshttps://doi.org/10.1109/tr.2014.2299673openalex-snapshot
A New Efficient Approach to Search for All Multi-State Minimal Cuts
inferred← citeshttps://doi.org/10.1109/tr.2019.2935630openalex-snapshot
A New Solution Algorithm for the Multistate Minimal Cut Problem
inferred← citeshttps://doi.org/10.1109/tr.2021.3075577openalex-snapshot
An Innovative and Very Efficient Algorithm for Searching All Multistate Minimal Cuts Without Duplicates
inferred← citeshttps://doi.org/10.1109/words.1999.806573openalex-snapshot
On the availability of k-coteries in networks with unreliable nodes and links
inferred← citeshttps://doi.org/10.1109/wsc.2012.6465033openalex-snapshot
Dependent failures in highly reliable static networks
inferred← citeshttps://doi.org/10.5281/zenodo.1059997openalex-snapshot
Bounds On Reliability Of Parallel Computer Interconnection Systems
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.