The following pages link to (Q4796165):
Displaying 31 items.
- On computing the diameter of real-world undirected graphs (Q386904) (← links)
- Approximate shortest paths in weighted graphs (Q414929) (← links)
- Some results on approximate 1-median selection in metric spaces (Q418725) (← links)
- Compact navigation and distance oracles for graphs with small treewidth (Q472468) (← links)
- All-pairs bottleneck paths in vertex weighted graphs (Q633850) (← links)
- Discovery of network properties with all-shortest-paths queries (Q962167) (← links)
- Approximate shortest paths guided by a small index (Q973004) (← links)
- Efficient approximation algorithms for shortest cycles in undirected graphs (Q987804) (← links)
- Solving path problems on the GPU (Q991105) (← links)
- Ramsey partitions and proximity data structures (Q997827) (← links)
- All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904) (← links)
- Shortest paths in linear time on minor-closed graph classes, with an application to Steiner tree approximation (Q1028460) (← links)
- Finding the first \(K\) shortest paths in a time-window network. (Q1427091) (← links)
- A new approach to all-pairs shortest paths on real-weighted graphs (Q1884872) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Vertex labeling and routing for Farey-type symmetrically-structured graphs (Q2333775) (← links)
- Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models (Q2375302) (← links)
- A survey of the all-pairs shortest paths problem and its variants in graphs (Q2629565) (← links)
- QUBO formulations of the longest path problem (Q2658047) (← links)
- A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs (Q2891383) (← links)
- Approximating average parameters of graphs (Q3514701) (← links)
- Approximating Shortest Paths in Graphs (Q3605483) (← links)
- Shortest-path queries in static networks (Q5176178) (← links)
- Low-Distortion Inference of Latent Similarities from a Multiplex Social Network (Q5255011) (← links)
- Labeled shortest paths in digraphs with negative and positive edge weights (Q5321778) (← links)
- Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs (Q5458575) (← links)
- Compact roundtrip routing with topology-independent node names (Q5900132) (← links)
- Many distances in planar graphs (Q5920250) (← links)
- (Q6065424) (← links)
- A novel pseudo‐polynomial approach for shortest path problems (Q6087148) (← links)
- Shortest distances as enumeration problem (Q6184314) (← links)
