Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 913349

From MaRDI portal
Publication:4887741
Jump to:navigation, search

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(199603)27:2<125::AID-NET4>3.0.CO;2-M" /><125::AID-NET4>3.0.CO;2-M 10.1002/(SICI)1097-0037(199603)27:2<125::AID-NET4>3.0.CO;2-MzbMath0851.90051MaRDI QIDQ4887741

Laura Schoppmann, J. T. Saccoman, Louis Petingi

Publication date: 5 August 1996


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

undirected graphall-terminal reliability


Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)


Related Items (5)

Heuristic maximization of the number of spanning trees in regular graphs ⋮ Uniformly optimally reliable graphs: A survey ⋮ Network reliability: Heading out on the highway ⋮ Invulnerability of planar two-tree networks ⋮ Uniformly optimal graphs in some classes of graphs with node failures




This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4887741&oldid=19267596"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 05:26.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki