Subject
Geometry and Topology,Discrete Mathematics and Combinatorics
Reference34 articles.
1. Complexity of network reliability computations
2. Bounds on the Reliability Polynomial for Shellable Independence Systems
3. Combinatorial optimization problems in the analysis and design of probabilistic networks
4. , , and , On the validity of a reduction of reliable network design to a graph extremal problem. IEEE Trans. Circuits and Systems (submitted).
5. The cut frequency vector. Graph Theory with Application to Algorithms and Computer Science (, , , and , Eds.), Wiley, New York (1985) 103–121.
Cited by
91 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献