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

scientific article

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

zbMATH Open0641.68012MaRDI QIDQ3782734

Charles J. Colbourn

Publication date: 1986



Title of this publication is not available (Why is that?)


zbMATH Keywords

surveyreliabilitycomputation complexitycomputer communications networks


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15) Theory of software (68N99)



Related Items (6)

Exact reliabilities of most reliable double-loop networks ⋮ Algebraic Methods Applied to Network Reliability Problems ⋮ Title not available (Why is that?) ⋮ Computing and maximizing the exact reliability of wireless backhaul networks ⋮ Title not available (Why is that?) ⋮ A Polynomial-Time Approximation Algorithm for All-Terminal Network Reliability






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 Q3782734)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3782734&oldid=17336434"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 14:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki