首页> 外文OA文献 >A Multi-Source Label-Correcting Algorithm for the All-Pairs Shortest Paths Problem

【2h】

A Multi-Source Label-Correcting Algorithm for the All-Pairs Shortest Paths Problem

机译：全对最短路径问题的多源标签校正算法

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Hiroki Yanagisawa;
展开▼
作者单位

展开▼
年度 2012
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths [J] . Stefan Kratsch, Florian Nelles LIPIcs : Leibniz International Proceedings in Informatics . 2020,第30期

机译：用于计算全对最短路径的高效参数化算法
2. All-Pairs Shortest Path algorithms for planar graph for GPU-accelerated clusters [J] . Hristo Djidjev, Guillaume Chapuis, Rumen Andonov, Journal of Parallel and Distributed Computing . 2015,第NOVa期

机译：GPU加速集群的平面图的全对最短路径算法
3. Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms [J] . Arm Pradhan, Mahinthakumar Journal of Computing in Civil Engineering . 2013,第3期

机译：使用并行Floyd-Warshall和并行Dijkstra算法寻找大型运输网络的全对最短路径
4. A multi-source label-correcting algorithm for the all-pairs shortest paths problem [C] . Yanagisawa H. 2010 IEEE International Symposium on Parallel amp; Distributed Processing (IPDPS) . 2010

机译：全对最短路径问题的多源标签校正算法
5. Shortest Path Algorithms for Dynamic Transportation Networks [D] . Alhoula, Wedad. 2019

机译：动态运输网络的最短路径算法
6. Shortest Path Algorithm in Dynamic Restricted Area Based on Unidirectional Road Network Model [O] . Haitao Wei, Shusheng Zhang, Xiaohui He 2021

机译：基于单向道路网络模型的动态禁区最短路径算法
7. Tree-Deletion Pruning in Label-Correcting Algorithms for the Multiobjective Shortest Path Problem [O] . Bökler, Fritz, Mutzel, Petra 2016

机译：用于标记校正算法的树删除修剪多目标最短路径问题
8. Minimizing Communication in All-Pairs Shortest Paths. [R] . A. Buluc E. Solomonik J. Demmel 2013

机译：最小化所有对最短路径中的通信。

A Multi-Source Label-Correcting Algorithm for the All-Pairs Shortest Paths Problem

著录项

引文网络

相似文献

相关主题

期刊订阅