scientific article; zbMATH DE number 913349
From MaRDI portal
DOI10.1002/(SICI)1097-0037(199603)27:2%3C125::AID-NET4%3E3.0.CO;2-MzbMATH Open0851.90051MaRDI QIDQ4887741FDOQ4887741
Authors: John T. Saccoman, Laura Schoppmann, L. Petingi 
Publication date: 5 August 1996
Title of this publication is not available (Why is that?)
Recommendations
- Uniformly least reliable graphs in class \(\Omega (n,e)\) as \(e\leq n+1\).
- Classes of uniformly most reliable graphs for all-terminal reliability
- Some conjectured uniformly optimal reliable networks
- On reliability of graphs with node failures
- Nonexistence of uniformly most reliable two-terminal graphs
Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35)
Cited In (7)
- Uniformly least reliable graphs in class \(\Omega (n,e)\) as \(e\leq n+1\).
- Classes of uniformly most reliable graphs for all-terminal reliability
- Invulnerability of planar two-tree networks
- Uniformly optimal graphs in some classes of graphs with node failures
- Heuristic maximization of the number of spanning trees in regular graphs
- Uniformly optimally reliable graphs: A survey
- Network reliability: Heading out on the highway
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887741)
