Formal Programming for the Shortest Path and Its Critical Edge Problems

摘要：

Many problems in operations research can be formulated in terms of networks,among which the shortest path is a particularly important class.Using the PAR method,we formally derive and implement algorithmic programs for three typical network problems,including the shortest path tree (SPT) problem,the most vital edge (MVE)problem,and the real time critical edge (RTCE)problem,which are motivated by routing applications.The main ideas and ingenuity of these algorithms are revealed by formula deduction.

关键词： Networks Algorithmic programs PAR method Shortest path Critical edge

作者: Yujun Zheng Jinyun Xue Haihe Shi

作者单位: Provincial Key Laboratory of High Performance Computing,Jiangxi Normal University,Nanchang 330027,Ch Provincial Key Laboratory of High Performance Computing,Jiangxi Normal University,Nanchang 330027,Ch

会议类型: 国际会议

会议名称: 2007 IEEE International Conference on Automation and Lofistics

会议地点: 山东济南

会议语种:英文

在线出版日期: 2007-08-18（万方平台首次上网日期，不代表论文的发表时间）