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

Parallel algorithms for terminal-pair reliability

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

DOI10.1109/24.257782zbMATH Open0825.68218OpenAlexW2146526497MaRDI QIDQ4018969FDOQ4018969


Authors: Narsingh Deo, Muralidhar Medidi Edit this on Wikidata


Publication date: 16 January 1993

Published in: IEEE Transactions on Reliability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/24.257782





Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25) Reliability, testing and fault tolerance of networks and computer systems (68M15)



Cited In (2)

  • Terminal-pair reliability in ATM virtual path networks
  • A network reduction axiom for efficient computation of terminal-pair reliability





This page was built for publication: Parallel algorithms for terminal-pair reliability

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

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