Pages that link to "Item:Q3158540"
From MaRDI portal
The following pages link to Undirected single-source shortest paths with positive integer weights in linear time (Q3158540):
Displaying 50 items.
- An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723) (← links)
- On the second point-to-point undirected shortest simple path problem (Q395858) (← links)
- Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs (Q396686) (← links)
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs (Q396709) (← links)
- Path Laplacian matrices: introduction and application to the analysis of consensus in networks (Q417470) (← links)
- The saga of minimum spanning trees (Q458468) (← links)
- Cycle bases in graphs characterization, algorithms, complexity, and applications (Q458496) (← links)
- Hybrid Bellman-Ford-Dijkstra algorithm (Q511150) (← links)
- Finding a minimum-depth embedding of a planar graph in \(O(n^{4})\) time (Q547303) (← links)
- On bounded leg shortest paths problems (Q633848) (← links)
- On dynamic shortest paths problems (Q639278) (← links)
- A survey of geodesic paths on 3D surfaces (Q654287) (← links)
- Two fast algorithms for all-pairs shortest paths (Q875428) (← links)
- Approximate distance oracles for graphs with dense clusters (Q883232) (← links)
- Convex \(p\)-partitions of bipartite graphs (Q897926) (← links)
- An \(O(n^{3}(\log\log n /\log n )^{5/4})\) time algorithm for all pairs shortest path (Q930607) (← links)
- An \(\tilde{O}(m^{2}n)\) algorithm for minimum cycle basis of graphs (Q1006382) (← links)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing (Q1044022) (← links)
- A universal concept for robust solving of shortest path problems in dynamically reconfigurable graphs (Q1665401) (← links)
- Near-linear time constant-factor approximation algorithm for branch-decomposition of planar graphs (Q1730234) (← links)
- Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs (Q1771306) (← links)
- A new approach to all-pairs shortest paths on real-weighted graphs (Q1884872) (← links)
- Approximation algorithms for the optimal \(p\)-source communication spanning tree (Q1887037) (← links)
- An improved algorithm for the \(k\)-source maximum eccentricity spanning trees (Q1887071) (← links)
- A simpler and more efficient algorithm for the next-to-shortest path problem (Q1939658) (← links)
- A spectral approach to the shortest path problem (Q2020688) (← links)
- Optimal centrality computations within bounded clique-width graphs (Q2093567) (← links)
- Linear-time parameterized algorithms with limited local resources (Q2105436) (← links)
- Improved distance queries and cycle counting by Frobenius normal form (Q2321929) (← links)
- Solving all-pairs shortest path by single-source computations: theory and practice (Q2403799) (← links)
- Shortest paths in time-dependent FIFO networks (Q2428679) (← links)
- Polynomial algorithms for guillotine cutting of a rectangle into small rectangles of two kinds (Q2456409) (← links)
- A survey of the all-pairs shortest paths problem and its variants in graphs (Q2629565) (← links)
- Faster cut sparsification of weighted graphs (Q2696277) (← links)
- A novel linear algorithm for shortest paths in networks (Q2836524) (← links)
- Linear-Space Approximate Distance Oracles for Planar, Bounded-Genus and Minor-Free Graphs (Q3012798) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663) (← links)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
- Toward Tight Approximation Bounds for Graph Diameter and Eccentricities (Q5009785) (← links)
- The idemetric property: when most distances are (almost) the same (Q5160620) (← links)
- Bypassing Erdős’ Girth Conjecture: Hybrid Stretch and Sourcewise Spanners (Q5167871) (← links)
- (Q5240196) (← links)
- Faster algorithms for shortest path and network flow based on graph decomposition (Q5240369) (← links)
- A Forward-Backward Single-Source Shortest Paths Algorithm (Q5255013) (← links)
- A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes (Q5302069) (← links)
- Shortest paths avoiding forbidden subpaths (Q5326797) (← links)
- (Q5743466) (← links)
- Integer priority queues with decrease key in constant time and the single source shortest paths problem (Q5917573) (← links)
