Optimum requirement spanning trees and reliability of tree networks

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199909)34:2<122::AID-NET5>3.0.CO;2-P" /><122::AID-NET5>3.0.CO;2-P 10.1002/(SICI)1097-0037(199909)34:2<122::AID-NET5>3.0.CO;2-PzbMath0959.90014OpenAlexW2043858310MaRDI QIDQ4267393

Tsutomu Anazawa, Takayuki Kodera, Masakazu Jimbo

Publication date: 4 October 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199909)34:2<122::aid-net5>3.0.co;2-p

zbMATH Keywords

networksoptimum requirement spanning tree

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (1)

Network reliability: Heading out on the highway

This page was built for publication: Optimum requirement spanning trees and reliability of tree networks