ALGORITHMS FOR FINDING THE MOST VITAL EDGE ON CERTAIN NETWORK PROBLEMS
博士 === 國立清華大學 === 工業工程研究所 === 83 === A rupture edge may cause unexpected loss in the network system. If an edge causes the maximum loss then it is called the most vital edge. Systematically, consider a criterion function $F$ on the connected subgraph of...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1995
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/94802687931467390787 |