首页> 外文会议>Scandinavian Workshop on Algorithm Theory(SWAT 2004); 20040708-20040710; Humlebaek; DK >Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths
【24h】

Cache-Oblivious Data Structures and Algorithms for Undirected Breadth-First Search and Shortest Paths

机译:无定向广度优先搜索和最短路径的高速缓存不可忽略的数据结构和算法

获取原文
获取原文并翻译 | 示例

摘要

We present improved cache-oblivious data structures and algorithms for breadth-first search and the single-source shortest path problem on undirected graphs with non-negative edge weights. Our results removes the performance gap between the currently best cache-aware algorithms for these problems and their cache-oblivious counterparts. Our shortest-path algorithm relies on a new data structure, called bucket heap, which is the first cache-oblivious priority queue to efficiently support a weak DECREASEKEY operation.
机译:我们针对宽度优先搜索和具有非负边权重的无向图上的单源最短路径问题,提出了改进的,可忽略缓存的数据结构和算法。我们的结果消除了当前针对这些问题的最佳高速缓存感知算法和其高速缓存无关的算法之间的性能差距。我们的最短路径算法依赖于称为“桶堆”的新数据结构,这是第一个可有效支持弱DECREASEKEY操作的缓存忽略优先级队列。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号