Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

On the reliability of series-parallel networks in grid graphs

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

zbMATH Open1249.90057MaRDI QIDQ2885294FDOQ2885294


Authors: T. A. Aldyn-ool, A. I. Erzin Edit this on Wikidata


Publication date: 21 May 2012

Published in: Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya: Matematika, Mekhanika, Informatika (Search for Journal in Brave)





Recommendations

  • The most reliable series-parallel networks
  • scientific article; zbMATH DE number 4097115
  • A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
  • Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks
  • scientific article; zbMATH DE number 3948155


zbMATH Keywords

reliability evaluationredundunt networkreliability of information network


Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)



Cited In (3)

  • Title not available (Why is that?)
  • MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKS
  • The most reliable series-parallel networks





This page was built for publication: On the reliability of series-parallel networks in grid graphs

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2885294&oldid=15841355"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 19:32. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki