共 50 条
- [31] AN ALGORITHM FOR GETTING A MINIMUM CUT-SET OF A GRAPH [J]. LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1986, 84 : 17 - 24
- [32] Generalized Cut-Set Bounds for Broadcast Networks [J]. 2013 51ST ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2013, : 832 - 838
- [33] NEW ALGORITHM FOR CUT-SET MATRIX SYNTHESIS [J]. JOURNAL OF THE FRANKLIN INSTITUTE-ENGINEERING AND APPLIED MATHEMATICS, 1978, 305 (04): : 187 - 198
- [34] Network Coding for Computing: Cut-Set Bounds [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (02) : 1015 - 1030
- [35] Efficient Algorithm for Dominating Set in Graph Theory Based on Fundamental Cut-Set [J]. GAZI UNIVERSITY JOURNAL OF SCIENCE, 2024, 37 (02): : 636 - 652
- [38] The Reliability of the Interconnection Networks Through Self Generating Disjoint Minimal Cut-Set Method [J]. 2010 IEEE 4TH INTERNATIONAL SYMPOSIUM ON ADVANCED NETWORKS AND TELECOMMUNICATION SYSTEMS (ANTS), 2010, : 97 - 99
- [39] Cut-Set Bound for Generalized Networks with Deterministic Channels [J]. 2014 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS (ISITA), 2014, : 541 - 545
- [40] UNIMODULAR PROPERTY OF FUNDAMENTAL CUT-SET AND CIRCUIT MATRICES [J]. MATRIX AND TENSOR QUARTERLY, 1971, 22 (02): : 65 - &