Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 56 for “"shortest paths"”.
-
Data Procurement for Shortest Paths on Random Graphs
While Dijkstra's algorithm finds the shortest path between two nodes on a graph with known edge weights, we approach the shortest paths problem for graphs with random edge weights described by known probability distributions. We introduce the idea of a budget of size k which allows us to replace k …
-
Single-face non-crossing shortest paths in planar graphs
The student, Alexander Steiger, submitted this Thesis for approval on 2017-07-12 at 16:52.
-
Finding Patterns, Short Cycles and Long Shortest Paths in Graphs
… specific bigger structures such as the longest shortest path in a graph, the size of which is represented by the diameter of a graph. Finding these structures has many applications, from protein-protein interactions in biology to anomaly detection in networks. We start by the problem of finding …
-
The power of quasi-shortest paths and the impact of node mobility on dynamic networks
… transmission, the effect of the use of longer paths on the relative importance of nodes and the performance of the network in the presence of failure on central nodes. To analyze the first aspect, this work proposes the (κ, λ)-vicinity, which extends the traditional vicinity to consider as …
-
Shortest paths, Markov chains, matrix scaling and beyond : improved algorithms through the lens of continuous optimization
… minimum cost flow problem, which encompasses the shortest path with negative weights and minimum cost bipartite perfect matching problems. In the case of sparse graphs, this provides the first running time improvement for these problems in over 25 years. *-- We initiate the study of solving linear …
-
Dynamic shortest paths algorithms : parallel implementations and application to the solution of dynamic traffic assignment models
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 1998.
-
Representing shortest paths in graphs using Bloom filters without false positives and applications to routing in computer networks
… some assumptions (the graph is known, and only shortest paths are encoded), there will be no false positives leading to a message being delivered to a wrong node.
-
Field D* pathfinding in weighted simplicial complexes
… graph search algorithms, such as Dijkstra’s shortest path and A*, can be used. However, many environments are constructed from a set of regions that do not conform to a discrete graph. The Weighted Region Problem was proposed to address the problem of finding the shortest path through a set …
-
Accelerating dynamic programming
… we show that planar graph problems such as shortest paths, feasible flow, bipartite perfect matching, and replacement paths can be accelerated by DPs that exploit a total-monotonicity property of the shortest paths. - Combining Compression and Total Monotonicity. We introduce a method for …
-
ΤΕΧΝΙΚΕΣ ΣΧΕΔΙΑΣΜΟΥ ΠΑΡΑΛΛΗΛΩΝ ΑΛΓΟΡΙΘΜΩΝ ΚΑΙ Η ΕΦΑΡΜΟΓΗ ΤΟΥΣ ΣΕ ΠΡΟΒΛΗΜΑΤΑ ΓΡΑΦΩΝ
… FOR THE FOLLOWING PROBLEMS: 1. FINDING SHORTEST PATHS AND DISTANCES IN PLANAR DIGRAPH. 2. FINDING AN APPROXIMATION SOLUTION FOR THE ENUMERATION VERSION OF THE MAX CUT PROBLEM. 3. COLORING OF RANDOM GRAPHS.
-
Effects of loss rate on ad hoc wireless routing
… driven by the observed loss rates, show that the shortest paths chosen by existing routing protocols tend to find routes with much less capacity than is available along the best route.
-
GRAPH-BASED METHODS FOR PATH PLANNING WITH DYNAMIC OBSTACLES USING LINEAR TEMPORAL LOGIC
… less computational effort to find one of the shortest paths for the mission The Multigraph Network Planning method and the Critical Path method can find all the possible paths with predetermined path length. The Random Walk method required more computational effort and memory compared to the …
-
Parameterized Relaxations for Circuits and Graphs
… tackle the All-Pairs Connectivity and Disjoint Shortest Paths problems. In the All-Pairs Connectivity (APC) problem, we are given an unweighted, directed graph G on n vertices, and are tasked with computing the maximum flow between each pair of vertices in G. Despite significant research on the …
-
Time Dynamic Label-Constrained Shortest Path Problems with Application to TRANSIMS: A Transportation Planning System
… is to find time-dependent label-constrained shortest paths for transportation activities performed by travelers in the system. There are several variations of shortest path problems and algorithms that vary by application, contexts, complexity, required data, and computer implementation …
-
Work Zone Analysis Under Detour Settings
… transportation network and let users find the shortest paths which will eventually come to equilibrium. The total work zone cost consists of total delay cost, work zone set-up cost and accident cost. The analysis is based on an illustrative transportation network, the Sioux-Falls network. The …
-
Tight estimation of bichromatic farthest pair in graphs and related problems
… where the diameter of a graph is the largest shortest paths distance and the radius is the smallest distance for which a "center" node can reach all other nodes. The natural and important ST-variant considers two subsets S and T of the vertex set and lets the ST-diameter be the maximum …
-
Path optimization using sub-Riemannian manifolds with applications to astrodynamics
… geometry provides mechanisms for finding shortest paths in metric spaces. This work describes a procedure for creating a metric space from a path optimization problem description so that the formalism of differential geometry can be applied to find the optimal paths. Most path optimization …
-
Scalable data analytics techniques for summarizing spatial network-based observations
… crime reports) and the goal is to find k shortest paths that summarize the activities. SNAS is important for applications where observations occur along linear paths such as roadways, train tracks, etc. Previous work has focused on either geometry or subgraph-based approaches (e.g., only …
-
Optimization based nonlinear feedback control for pedestrian evacuation from a network of corridors
… flow routing problem is based on the concept of shortest paths on a graph wherein the shortest paths are determined by the dynamic programming approach. The proposed approach can be used to determine the static shortest paths that are commonly displayed as evacuation routes in the buildings. The …
-
Loop detection and prevention mechanism in multiprotocol label switching
… loop formation occurs at the control path. The shortest paths between selected source and destination have been calculated using Dijkstra's shortest path algorithm and threads are allowed to extend through the routers. With the passage of each next hop, a distributed procedure is executed within …
Page 1 of 3