Consecutive-2 systems on trees

DOI10.1017/S0269964800000516MaRDI QIDQ3415858zbMATH OpenOpenAlexFDO

Authors Miklos Santha, Yanjun 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)

Recommendations

• Optimal consecutive-2 systems of lines and cycles
• Reliabilities of Consecutive-2 Graphs
• Optimal Assignments for Consecutive-2 Graphs
• Optimal Consecutive-k−Out−of−n Systems under a Fixed Budget
• Optimal Consecutive-2-Out-of-n Systems

Cites work

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

Cited in

(5)

• Optimal consecutive-2 systems of lines and cycles
• Sequential construction of a circular consecutive-2 system
• Rare-event component importance for the consecutive-k system
• Optimal Assignments for Consecutive-2 Graphs
• Reliabilities of Consecutive-2 Graphs

This page was built for publication: Consecutive-2 systems on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3415858)