| 降维法计算扩展网络的最短路径 |
| |
| 引用本文： | 范英飚,王劲松,王新.降维法计算扩展网络的最短路径[J].海军航空工程学院学报,2005,20(2):285-287. |
| |
| 作者姓名： | 范英飚 王劲松 王新 |
| |
| 作者单位： | 海军驻北京地区某军事代表室，海军航空工程学院研究生管理大队，海军装备部驻天津军事代表局 北京，100854，烟台，264001，天津，300061 |
| |
| 摘 要： | 以在军事等领域具有重要应用的扩展网络为研究对象,研究并提出了基于最短路树的网络降维方法。当子网络之间有边互连的节点数远小于原网络节点数时,利用降维网络计算扩展网络的最短路径具有很好的效果。
|
| 关 键 词： | 最短路树 最短路径 扩展网络 |
| 修稿时间： | 2004年10月20 |
Search the SP in an Extended Network by Dimension Reduction |
| |
| FAN Ying-biao,WANG Jin-song,WANG Xin Military Representatives Office of Navy in Beijing,Beijing, Graduate Students'Brigade of NAEI,Yantai, Military Representatives Office of NED in Tianjin,Tianjin.Search the SP in an Extended Network by Dimension Reduction[J].Journal of Naval Aeronautical Engineering Institute,2005,20(2):285-287. |
| |
| Authors: | FAN Ying-biao WANG Jin-song WANG Xin Military Representatives Office of Navy in Beijing Beijing Graduate Students'Brigade of NAEI Yantai Military Representatives Office of NED in Tianjin Tianjin |
| |
| Institution: | FAN Ying-biao,WANG Jin-song,WANG Xin Military Representatives Office of Navy in Beijing,Beijing,100854 Graduate Students'Brigade of NAEI,Yantai,264001, Military Representatives Office of NED in Tianjin,Tianjin,300061 |
| |
| Abstract: | In the paper, characteristics of the shortest path (SP) in an extended network are analyzed. Then a dimension reduction method based on the shortest path tree is brought forward, which may be used to search the shortest path. Under circumstances that the edges connecting two sub-networks is very less, the availability of dimension reduction is very apparent. |
| |
| Keywords: | the most shortest path tree the shortest path an extend network |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
