Directed Fuzzy Networks as a Model to Illicit Flows and Max Flow Min Cut Theorem
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. Algorithms for Two Bottleneck Optimization Problems , 1988, J. Algorithms.
[2] Mostafa H. Dahshan,et al. Maximum-Bandwidth Node-Disjoint Paths , 2013, ArXiv.
[3] Humberto Bustince,et al. Contrast of a fuzzy relation , 2010, Inf. Sci..
[4] Azriel Rosenfeld,et al. FUZZY GRAPHS††The support of the Office of Computing Activities, National Science Foundation, under Grant GJ-32258X, is gratefully acknowledged, as is the help of Shelly Rowe in preparing this paper. , 1975 .
[5] Sunil Mathew,et al. Node connectivity and arc connectivity of a fuzzy graph , 2010, Inf. Sci..
[6] Lotfi A. Zadeh,et al. Is there a need for fuzzy logic? , 2008, NAFIPS 2008 - 2008 Annual Meeting of the North American Fuzzy Information Processing Society.
[7] Sunil Mathew,et al. Types of arcs in a fuzzy graph , 2009, Inf. Sci..