Most vital links and nodes in weighted networks |
| |
| Authors: | HW Corley David Y Sha |
| |
| Institution: | Department of Industrial Engineering, The University of Texas at Arlington, Arlington, TX 76019, U.S.A. |
| |
| Abstract: | The n most vital links (or nodes) in a weighted network are those n links (nodes) whose removal from the network results in the greatest increase in shortest distance between two specified nodes. Preliminary results are presented for obtaining these entities. |
| |
| Keywords: | Networks distance algorithms applications |
| 本文献已被 ScienceDirect 等数据库收录！ |
