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

Computing diameter constrained reliability of a network with junction points

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

DOI10.1134/S0005117911070095zbMath1226.90022OpenAlexW2130958205MaRDI QIDQ649994

D. A. Migov

Publication date: 25 November 2011

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117911070095



Mathematics Subject Classification ID

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


Related Items (1)

VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY




Cites Work

  • Unnamed Item
  • Reliability of communication networks with delay constraints: computational complexity and complete topologies
  • A decomposition algorithm for network reliability evaluation
  • On the characterization of the domination of a diameter-constrained network reliability model
  • Reliable circuits using less reliable relays




This page was built for publication: Computing diameter constrained reliability of a network with junction points

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