Algorithms of All Pair Shortest Path Problem
نویسندگان
چکیده
منابع مشابه
All Colors Shortest Path Problem
All Colors Shortest Path problem defined on an undirected graph aims at finding a shortest, possibly non-simple, path where every color occurs at least once, assuming that each vertex in the graph is associated with a color known in advance. To the best of our knowledge, this paper is the first to define and investigate this problem. Even though the problem is computationally similar to general...
متن کاملContinuum of All-Pair Shortest-Path to All-Path via Random Walk
A method is proposed to compute the continuum of paths, from shortest paths to all random paths between all pairs of nodes at once in a unified way. The analysis is based on treating the network as a random walk with an additional absorbing state named evaporating state reachable with nonzero probability from any state (so called “evaporating random walk”). The probability of avoiding absorptio...
متن کاملMemory-Constrained Algorithms for Shortest Path Problem
We present an algorithm computing a shortest path between to vertices in a square grid graph with edge weights that uses memory less than linear in the number of vertices (apart from that for storing in the input). For any ε > 0, our algorithm uses a work space of O(n) words and runs in O(n) time.
متن کاملThe All-Pair Shortest-Path Problem in Shared-Memory Heterogeneous Systems
This chapter faces the All-Pair Shortest-Path problem for sparse graphs combining parallel algorithms and parallel-productivity methods in heterogeneous systems. As this problem can be divided into independent Single-Source ShortestPath subproblems, we distribute this computation space into different processing units, CPUs and graphical processing units (GPUs), that are usually present in moder...
متن کاملSolving the all-pair shortest path query problem on interval and circular-arc graphs
In this paper, we study the following all-pair shortest path query problem: Given the interval model of an unweighted interval graph of n vertices, build a data structure such that each query on the shortest path (or its length) between any pair of vertices of the graph can be processed eeciently (both sequentially and in parallel). We show that, after sorting the input intervals by their endpo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2015
ISSN: 0975-8887
DOI: 10.5120/21300-3876