Shortest Paths
Pruning the Computation of Distributed Shortest Paths in Power-law Networks
... We propose a general, simple and practical technique, named Distributed Leafs Pruning (DLP), which can be combined with every distance vector routing algorithm based on shortest paths, allowing to reduce ...
14
Lower and upper bounds of shortest paths in reachability graphs
... 5. Extended free-choice systems. In this section, we obtain an upper bound for the length of the shortest paths between two reachable markings of a live and safe extended free-choice system. It is never ...
14
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation
... In this Section we describe a new incremental algorithm for the concurrent update of distributed all-pairs shortest paths in the case of multiple operations. This algorithm is an extension of the ...
11
Multi Sentence Compression: Finding Shortest Paths in Word Graphs
... We considered the task of generating a short in- formative summary for a set of related sentences, called multi-sentence compression, which arises naturally in the context of multi-document text summarization. We ...
9
Comprehensive Study on Computational Methods for K Shortest Paths Problem
... This review is carried out to explore the basic types of the algorithms available for computing loop less K-shortest paths between a pair of nodes in a network and to reflect their computational procedure ...
5
Shortest paths in one counter systems
... along shortest paths is extended to an upper bound on the size of terms that can be used in a minimal deductive proof; needless to say, an improvement in the upper bound extends in a natural ...
28
Exploiting Graph Structure for Accelerating the Calculation of Shortest Paths in Wordnets
... all shortest paths by first computing and storing the paths lengths between nodes that are close to each other, and then moving on to longer paths by combining the results of the shorter ...
8
All Pairs Shortest Paths Algorithm for High dimensional Sparse Graphs
... (all-pairs shortest path problem) is one of the most popular tasks in graph theory because the shortest paths between all pairs of vertices are used for solving many problems involving discrete ...
5
Distance-Vector Algorithms for Distributed Shortest Paths on Dynamic Power-Law Networks
... On the one hand, Distance-Vector algorithms, such as, e.g., the Distributed Bellman-Ford (DBF) method [3], are characterized by a local nature, in the sense that a generic node executing this kind of algorithms usually ...
25
Tabu search optimization of forest road alignments combined with shortest paths and cubic splines
... for paths with costs associated with them, in which case one might search for the cheapest ...term shortest path is used in this ex- ...the shortest of all paths, or it may be temporary, ...
11
Shortest paths through synonymous genomes
... use shortest paths algorithms to determine which DNA stretches are easiest or hardest to bend inside a ...studying paths through graphs of synonymous ...
9
An Evolutionary Algorithm Coupled to an Outranking Method for the Multicriteria Shortest Paths Problem
... the shortest path problem in a multi-attribute graph, by the out- ranking ...incomparable paths thus forming the Pareto ...the shortest paths, we propose an evolutionary algorithm based on the ...
15
Fast algorithms for shortest paths
... The second algorithm presented, and the main result of this thesis, has an expected running time of On 2logn on graphs with edge weights drawn from an endpoint independent probability di[r] ...
178
An Improved Fast Watershed Algorithm based on finding the Shortest Paths with Breadth First Search
... A watershed based on rainfall simulation is a proven technique for image segmentation. The only problem associated with it is the path regularization for pixels in the plateau. As the existing methods employ sequential ...
9
Shortest Paths in Triangular Grids with Neighbourhood Sequences
... In this paper we analyse some properties of the triangular and hexagonal grids in the 2D digital space. We define distances based on neighbourhood relations that can be introduced in these grids. We present an algorithm, ...
12
Dijkstra‘s Algorithm for Effective Travelling to the Most Famous Destinations in Myanmar
... optimal paths for travelling to the most famous destinations in ...aSingle-Source Shortest Path (SSSP) iterative algorithm and the basic idea is searching a graph by findingpath, starting at a point, and ...
9
Random Walk Decay Centrality
... they assume that information always travels in a network through the fastest route(s)—an assumption that requires all nodes to know the entire topology of the network, which is rarely the case in real-world networks. In ...
8
Shortest Geometric Paths Analysis in Structural Biology
... The algorithm we develop here for measuring depth of macromolecular surfaces is a discretized approximation of a multiple shortest paths (MSP). The paths are initiated at the convex hull, and ...
346
On Classification of k Dimension Paths in n Cube
... Below we consider complexes of k-faces (here k-dimension of face in contrast to [4], where k-length along edges as shortest paths between vertex). Now we will give definition of k-path between two of ...
5
All Pairs Bottleneck Paths and Max-Min Matrix Products in Truly Subcubic Time
... We have provided the first truly subcubic algorithms for all pairs bottleneck paths and all pairs bottleneck shortest paths in general dense graphs, with no restrictions on edge weights or edge ...
17