ms·1974년 11월 1일
Finding the <i>n</i> Most Vital Nodes in a Flow Network
Management Science
55
피인용
0.0
FWCI
0
IS/마케팅/OM 탑저널 피인용
2
IS/마케팅/OM 탑저널 참고문헌
- 주제네트워크 흐름 최적화 · 생산·최적화
01Abstract
The n most vital nodes in a network are those n nodes whose removal, along with all arcs incident with them, would cause the greatest decrease in maximum flow between a specified node pair. Results are established for this problem that lead to a procedure for determining the n most vital nodes.
02연구 흐름
불러오는 중…
03비슷한 논문
불러오는 중…
04이후 연구
불러오는 중…
05선행 연구
불러오는 중…
06서지 정보
- 저널Management Science · 21(3) · 362–364
- 토픽Software System Performance and Reliability · Computer Networks and Communications
- DOI10.1287/mnsc.21.3.362
- 저자H. W. Corley, Hui-Chan Chang