Efficient Algorithms for Shortest Paths in Sparse Networks
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Efficient reconstruction of metabolic pathways by bidirectional chemical search
- Scaling algorithms for network problems
- A heuristic for the p-center problem in graphs
- An O(m log D) algorithm for shortest paths
- A new algorithm to find the shortest paths between all pairs of nodes
- Topological design of telecommunication networks --- local access design methods
- On an instance of the inverse shortest paths problem
- On the expected behaviors of the Dijkstra's shortest path algorithm for complete graphs
- On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
- Exact solutions for the construction of optimal length test sequences
- Incremental closure for systems of two variables per inequality
- Generating realistic labelled, weighted random graphs
- The windy rural postman problem with a time-dependent zigzag option
- The electric location routing problem with time windows and partial recharging
- Analyzing the stock market based on the structure of \textit{kNN} network
- Ranking the spreading ability of nodes in complex networks based on local structure
- Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs
- A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs
- A new approach to all-pairs shortest paths on real-weighted graphs
- All-pairs shortest paths and the essential subgraph
- Computation of shortest path in cellular automata
- All-pairs-shortest-length on strongly chordal graphs
- Synchronization paradigm for protocol testing under multiparty configuration
- A spectral approach to the shortest path problem
- Resilient capacity-aware routing
- Single-source shortest paths and strong connectivity in dynamic planar graphs
- What's decidable about weighted automata?
- Network inference combining mutual information rate and statistical tests
- The grid based approach, a fast local evaluation technique for line planning
- A lexicographic optimization approach to the deviation-flow refueling station location problem on a general network
- The geodesic distance on the generalized gamma manifold for texture image retrieval
- Truncated metric dimension for finite graphs
- Polynomial-time proofs that groups are hyperbolic
- Quickest path queries on transportation network
- Optimal path discovery problem with homogeneous knowledge
- Energy-optimal routes for battery electric vehicles
- Efficient transitive closure of sparse matrices over closed semirings
- Solving all-pairs shortest path by single-source computations: theory and practice
- Universal construction mechanism for networks from one-dimensional symbol sequences
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Rectilinear paths among rectilinear obstacles
- Fast algorithms for the undirected negative cost cycle detection problem
- A survey of the all-pairs shortest paths problem and its variants in graphs
- Convolutional Wasserstein distances: efficient optimal transportation on geometric domains
- A novel linear algorithm for shortest paths in networks
- A survey on priority queues
- Power-law noises over general spatial domains and on nonstandard meshes
- Efficiently listing bounded length \(st\)-paths
- Solving the all-pairs-shortest-length problem on chordal bipartite graphs
- Approximability results for the converse connected p-centre problem
- Exact solution approaches for the discrete lot-sizing and scheduling problem with parallel resources
- On covering by translates of a set
- Spreading dynamics in complex networks
- A quick method for finding shortest pairs of disjoint paths
- Shortest-path algorithms: Taxonomy and annotation
- Solving the nearly symmetric all-pairs shortest-path problem
- Strictly implicit priority queues: on the number of moves and worst-case time
- Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem
- A priority queue in which initialization and queue operations takeO(loglogD) time
- A Dijkstra-like shortest path algorithm for certain cases of negative arc lengths
- Fast query structures in anisotropic media
- An efficient algorithm for K shortest simple paths
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs
- Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem
- Approximate shortest paths in weighted graphs
- Crossover can provably be useful in evolutionary computation
- Optimally fast shortest path algorithms for some classes of graphs
- An efficient implementation of an algorithm for findingK shortest simple paths
- Faster all-pairs shortest paths via circuit complexity
- Correlation between weighted spectral distribution and average path length in evolving networks
- An all-pairs shortest path algorithm for bipartite graphs
- scientific article; zbMATH DE number 3795354 (Why is no real title available?)
- scientific article; zbMATH DE number 1416161 (Why is no real title available?)
- Faster separation of 1-wheel inequalities by graph products
- Nonlocal pagerank
- From circuit complexity to faster all-pairs shortest paths
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time
- Balancing geometry and density: path distances on high-dimensional data
- Dynamic conditional value-at-risk model for routing and scheduling of hazardous material transportation networks
- Using weighted graphs features for fast searching their parameters
- All-pairs shortest paths algorithm for high-dimensional sparse graphs
- The Wiener index of maximal outerplane graphs
- Shortest-path queries in static networks
- Identifying and ranking influential spreaders in complex networks by combining a local-degree sum and the clustering coefficient
- Faster algorithms for shortest path and network flow based on graph decomposition
- Labeled shortest paths in digraphs with negative and positive edge weights
- A language for generic programming in the large
- Examining k-nearest neighbour networks: superfamily phenomena and inversion
- Successful network inference from time-series data using mutual information rate
- Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time
- Computational complexity of the original and extended Diophantine Frobenius problem
- Exact distance oracles for planar graphs
- Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
- A scaling algorithm for maximum weight matching in bipartite graphs
- A novel algorithm for clearing financial obligations between companies - An application within the Romanian Ministry of economy
- Modifications of the Floyd-Warshall algorithm with nearly quadratic expected-time
- Parameterized complexity of diameter
- Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter
- An edge scanning method for the continuous deviation‐flow refueling station location problem on a general network
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
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)
