BriefGPT.xyz
Dec, 2021
图中最短路径的重新配置
Reconfiguring Shortest Paths in Graphs
HTML
PDF
Kshitij Gajjar, Agastya Vibhuti Jha, Manish Kumar, Abhiruk Lahiri
TL;DR
该研究论文提出一个问题:一次只修改一个顶点,从而将一个最短路径修改为另一个最短路径,其应用于优化网络中的路由算法,数据流管理,以及列车调度等优化问题,并基于图论方法研究该问题的复杂度与算法优化。
Abstract
Reconfiguring two
shortest paths
in a
graph
means modifying one shortest path to the other by changing one vertex at a time so that all the intermediate paths are also
→