Author:
Balcioglu Ahmet,Kevin Wood R.
Publisher
Kluwer Academic Publishers
Reference34 articles.
1. Abel, V., and Bicker, R., (1982), “Determination of All Minimal Cut-Sets between a Vertex Pair in an Undirected Graph,” IEEE Transactions on Reliability, Vol. R-31, pp. 167–171.
2. Ahmad, S.H., (1990), “Enumeration of Minimal Cutsets of an Undirected Graph,” Microelectronics Reliability, Vol. 30, pp. 23–26.
3. Avis, D., and Fukuda, K., (1996) “Reverse Search for Enumeration,” Discrete Applied Mathematics, Vol. 65, pp. 21–46.
4. Boyle, M.R., (1998), “Partial-Enumeration For Planar Network Interdiction Problems,” Master’s Thesis, Operations Research Department, Naval Postgraduate School, Monterey, California, March.
5. Bussieck, M.R., and Lübbecke, M.E., (1998), “The Vertex Set of a 0/1-Polytope is Strongly P-enumerable,” Computational Geometry, Vol. 11, pp. 103–109.
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献