Efficient Algorithms for Shortest Paths in Sparse Networks
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Fast query structures in anisotropic media
- A priority queue in which initialization and queue operations takeO(loglogD) time
- Fast reconstruction of an original continuous series from a recurrence plot
- Fast algorithms for the undirected negative cost cycle detection problem
- Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient
- A language for generic programming in the large
- Energy-optimal routes for battery electric vehicles
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Approximate shortest paths in weighted graphs
- Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem
- Incremental closure for systems of two variables per inequality
- Safety and liveness of quantitative automata
- A quick method for finding shortest pairs of disjoint paths
- A multiple-heaps algorithm for parallel simulation of collision systems
- Efficient computation of rectilinear geodesic Voronoi neighbor in presence of obstacles
- A survey of the all-pairs shortest paths problem and its variants in graphs
- Two fast algorithms for all-pairs shortest paths
- Ranking the spreading ability of nodes in complex networks based on local structure
- Efficient transitive closure of sparse matrices over closed semirings
- Generating realistic labelled, weighted random graphs
- Crossover can provably be useful in evolutionary computation
- A lexicographic optimization approach to the deviation-flow refueling station location problem on a general network
- Labeling methods for partially ordered paths
- Shortest-path algorithms: Taxonomy and annotation
- Polynomial-time proofs that groups are hyperbolic
- Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time
- Safety and liveness of quantitative properties and automata
- Modifications of the Floyd-Warshall algorithm with nearly quadratic expected-time
- Power-law noises over general spatial domains and on nonstandard meshes
- Scaling algorithms for network problems
- Computational complexity of the original and extended Diophantine Frobenius problem
- Faster all-pairs shortest paths via circuit complexity
- Weighted A^* search - unifying view and application
- Analyzing the stock market based on the structure of \textit{kNN} network
- The electric location routing problem with time windows and partial recharging
- Solving the all-pairs-shortest-length problem on chordal bipartite graphs
- Universal construction mechanism for networks from one-dimensional symbol sequences
- Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
- Quickest path queries on transportation network
- A spectral approach to the shortest path problem
- Solving the nearly symmetric all-pairs shortest-path problem
- scientific article; zbMATH DE number 1416161 (Why is no real title available?)
- A novel pseudo‐polynomial approach for shortest path problems
- A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs
- Computation of shortest path in cellular automata
- Exact distance oracles for planar graphs
- All-pairs shortest paths and the essential subgraph
- Path optimization with limited sensing ability
- Efficiently listing bounded length \(st\)-paths
- Approximability results for the converse connected p-centre problem
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- Retiming synchronous circuitry
- Almost optimal exact distance oracles for planar graphs
- Two-level heaps: a new priority queue structure with applications to the single source shortest path problem
- Minmax regret location--allocation problem on a network under uncertainty
- A Dijkstra-like shortest path algorithm for certain cases of negative arc lengths
- Solving all-pairs shortest path by single-source computations: theory and practice
- Solving path problems on the GPU
- A new approach to all-pairs shortest paths on real-weighted graphs
- Faster algorithms for shortest path and network flow based on graph decomposition
- The geodesic distance on the generalized gamma manifold for texture image retrieval
- A heuristic for the p-center problem in graphs
- Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter
- A new algorithm to find the shortest paths between all pairs of nodes
- A scaling algorithm for maximum weight matching in bipartite graphs
- Faster monotone min-plus product, range mode, and single source replacement paths
- Fully dynamic algorithms for minimum weight cycle and related problems
- Resilient capacity-aware routing
- All-pairs shortest paths algorithm for high-dimensional sparse graphs
- Planar graphs, negative weight edges, shortest paths, and near linear time
- On covering by translates of a set
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
- An all-pairs shortest path algorithm for bipartite graphs
- The distributed simulation of clustered processes
- Efficient reconstruction of metabolic pathways by bidirectional chemical search
- Depth-based complexity traces of graphs
- Shortest-path queries in static networks
- Successful network inference from time-series data using mutual information rate
- Truncated metric dimension for finite graphs
- On an instance of the inverse shortest paths problem
- Nonlocal pagerank
- Single-source shortest paths and strong connectivity in dynamic planar graphs
- A bi-criterion Steiner traveling salesperson problem with time windows for last-mile electric vehicle logistics
- Parameterized complexity of diameter
- Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs
- Exact solutions for the construction of optimal length test sequences
- Strictly implicit priority queues: on the number of moves and worst-case time
- Rectilinear paths among rectilinear obstacles
- All-pairs-shortest-length on strongly chordal graphs
- Correlation between weighted spectral distribution and average path length in evolving networks
- A novel approach for modeling order picking paths
- Labeled shortest paths in digraphs with negative and positive edge weights
- Faster separation of 1-wheel inequalities by graph products
- What's decidable about weighted automata?
- A distributed shortest path algorithm for a planar network
- Incremental distance products via faulty shortest paths
- Topological design of telecommunication networks --- local access design methods
- A novel algorithm for clearing financial obligations between companies - An application within the Romanian Ministry of economy
This page was built for publication: Efficient Algorithms for Shortest Paths in Sparse Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4111093)
