Some lattice-theoretic tools for network reliability analysis

0.00 Avg rating—0 Votes

Article ID:	iaor1988203
Country:	United States
Volume:	13
Issue:	3
Start Page Number:	467
End Page Number:	478
Publication Date:	Aug 1988
Journal:	Mathematics of Operations Research
Authors:	Bienstock Daniel
Keywords:	quality & reliability

Abstract:

The computation of K-terminal reliability for a graph is an intractable problem, and polynomially bounded algorithms are known for very limited classes of graphs only. This paper presents lattice-theoretic speed-up techniques for existing algorithmic ideas.

Reviews

Required fields are marked *. Your email address will not be published.