A simple algorithm to search for all minimal cutsets with unreliable nodes
From MaRDI portal
Publication:2743193
zbMATH Open1009.90015MaRDI QIDQ2743193
Author name not available (Why is that?)
Publication date: 9 September 2002
Published in: (Search for Journal in Brave)
Full work available at URL: http://www.csu.edu.au/ci/vol08/yeh01/
No records found.
No records found.
This page was built for publication: A simple algorithm to search for all minimal cutsets with unreliable nodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2743193)