Consecutive-2 systems on trees

DOI10.1017/S0269964800000516zbMath1134.90392OpenAlexW2083165318MaRDI QIDQ3415858

Miklos Santha, Yan-Jun Zhang

Publication date: 19 January 2007

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0269964800000516

Mathematics Subject Classification ID

Trees (05C05) Deterministic scheduling theory in operations research (90B35)

Related Items

Rare-event component importance for the consecutive-k system ⋮ Sequential construction of a circular consecutive-2 system

Cites Work

• Monte-Carlo algorithms for the planar multiterminal network reliability problem
• The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
• Optimal Consecutive-2-Out-of-n Systems
• Optimal Assignments for Consecutive-2 Graphs
• Optimal consecutive-2 systems of lines and cycles
• The Complexity of Enumeration and Reliability Problems