The problem of synthesis of reliable networks

DOI10.1007/BF02667067zbMath0999.68025MaRDI QIDQ5951291

F. A. Sharifov

Publication date: 6 January 2002

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

unidirected graph

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Reliability optimization of a complex system by the stochastic branch and bound method

Cites Work

• Unnamed Item
• Unnamed Item
• Shortest paths algorithms: Theory and experimental evaluation
• Finding Minimum-Cost Circulations by Successive Approximation
• Some Recent Advances in Network Flows
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm

This page was built for publication: The problem of synthesis of reliable networks