Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula - MaRDI portal

Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula

From MaRDI portal

Publication:1294685

Jump to:navigation, search

DOI10.1155/S1024123X98000817zbMath0941.90012OpenAlexW2056076594MaRDI QIDQ1294685

Laura Schoppmann, Thomas J. jun. Marlowe

Publication date: 9 August 1999

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/48486

zbMATH Keywords

computational complexity reliability networks graphs threshold graphs efficient recursive algorithms Gilbert's formula polynomial-time computations

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

This page was built for publication: Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1294685&oldid=13402691"