A theorem concerning cyclic directed graphs with applications to network reliability

DOI10.1002/net.3230100107zbMath0434.90045OpenAlexW2112967464MaRDI QIDQ3873892

Randall R. Willie

Publication date: 1980

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230100107

zbMATH Keywords

network reliabilityacyclic subgraphstopological formulacyclic directed graphsexact reliability evaluationterminal-pair directed networks

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Related Items (3)

On lattices with Möbius function \(\pm 1,0\) ⋮ Network reliability: Heading out on the highway ⋮ Domination of cyclic monotone \((s,t)\)-graphs

This page was built for publication: A theorem concerning cyclic directed graphs with applications to network reliability