| An Algorithm on Edge Partition |
| |
| 作者姓名： | JIA Zhen\|sheng Taiyuan University of Technology Taiyuan Shanxi |
| |
| 作者单位： | JIA Zhen\|sheng Taiyuan University of Technology，Taiyuan 030024，Shanxi |
| |
| 摘 要： | 1 BackgroudWhenacarisinaccidentonroad,itmustbepulledawaytoavoidserioustrafficjamandnewaccidentshappening.Inoneroadnet,ifacarforcleaningbarsisaskedtogettotheplace,duringashortspanoftimedemanded,whereaccidenttookplace,howmanyclearbarsStationsshouldbesetup?andwhereshouldtheybe?Weresolvedtheproblemwiththemethodofgraph.Aroadnetcorrespondstoadefinitegraph,inwhichavertexdenotesanoriginoraterminusofaroad,anedgedenotesaroadandaweightofanedgedenotesalengthofaroad.Therefore,theabove-mentionedproblemcan…
|
An Algorithm on Edge Partition |
| |
| JIA Zhen\|sheng Taiyuan University of Technology,Taiyuan ,Shanxi.An Algorithm on Edge Partition[J].Journal of Systems Science and Systems Engineering,2000(4). |
| |
| Authors: | JIA Zhen\|sheng Taiyuan University of Technology Taiyuan Shanxi |
| |
| Institution: | JIA Zhen\|sheng Taiyuan University of Technology,Taiyuan 030024,Shanxi |
| |
| Abstract: | In this paper, we presened a simple algorithm on edge partition. |
| |
| Keywords: | tree graph weighted graph weight of a vertex distance between vertex and edgeP |
| 本文献已被 CNKI 等数据库收录！ |
