Linking-Centers and Reliable-Trees of a Network

DOI10.1109/TR.1986.4335509MaRDI QIDQ4721051zbMATH OpenOpenAlexFDO

Authors Giulia Galbiati, Francesco Maffioli, Paolo M. Camerini

Publication date 1986

Published in IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tr.1986.4335509

zbMATH Keywords

center locationlocating a point on a networknetwork reliability

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27) Applications of mathematical programming (90C90)

Recommendations

• scientific article; zbMATH DE number 55681
• scientific article; zbMATH DE number 4095237
• scientific article; zbMATH DE number 3884207
• Properties of thek-centra in a tree network
• The multi-tree approach to reliability in distributed networks
• Optimum requirement spanning trees and reliability of tree networks
• scientific article; zbMATH DE number 1979494
• Using the Decomposition Tree for Directed-Network Reliability Computation
• On the construction of most reliable networks
• scientific article; zbMATH DE number 867686

Cited in

(3)

• In memoriam Paolo M. Camerini
• scientific article; zbMATH DE number 227372 (Why is no real title available?)
• Network location of a reliable center using the most reliable route policy

This page was built for publication: Linking-Centers and Reliable-Trees of a Network

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