| 随机网络的动态最短路研究 |
| |
| 引用本文： | 雷芬,朱英,徐婕,李赵祥.随机网络的动态最短路研究[J].中央民族大学学报(自然科学版),2008,17(4):47-53. |
| |
| 作者姓名： | 雷芬 朱英 徐婕 李赵祥 |
| |
| 作者单位： | 1. 中央民族大学,理学院,北京,100081
2. 张家界市第一中学,湖南,张家界,427000 |
| |
| 摘 要： | 本文对于权值为时间t的连续函数动态最短路的问题，通过先求解某个时刻从起点到终点的最短路，然后分析某个时刻的最短路与该时刻的邻域内的最短路关系，再借助有限覆盖定理，求解出某一闭时间区间内的最短路时．从一新途径研究了变权的最短路问题．
|
| 关 键 词： | 随机网络 动态最短路问题 有限覆盖定理 |
Research of Dynamic Shortest Path on a Random Network |
| |
| LEI Fen,ZHU Ying,XU Jie,LI Zhao-xiang.Research of Dynamic Shortest Path on a Random Network[J].Journal of The Central University for Nationalities(Natural Sciences Edition),2008,17(4):47-53. |
| |
| Authors: | LEI Fen ZHU Ying XU Jie LI Zhao-xiang |
| |
| Institution: | LEI Fen , ZHU Ying, XU Jie , LI Zhao-xiang ( 1. College of seience, Central University for Nationalities, Beijing 100081, China ; 2. Zhangjiajie No. 1 Middle School, Zhangjiajie . Hunan Province, 427000, China ) |
| |
| Abstract: | In this paper, we research on the problem of the dynamic shortest path in especially for the random network which weights are continuous functions of time ielation of the shortest path at a moment and a random network, t. the shortest path of the moment＇ s neighbo We discuss the rhood and get the solution for the shortest path from the start node to the end node at a moment using the limited coverage theorem and the advanced Dijkstra algorithm. |
| |
| Keywords: | random network dynamic shortest path limited coverage theorem |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
