Pages that link to "Item:Q5176178"
From MaRDI portal
The following pages link to Shortest-path queries in static networks (Q5176178):
Displaying 14 items.
- (Q3574266) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- Density Independent Algorithms for Sparsifying k-Step Random Walks (Q5002617) (← links)
- Central Positions in Social Networks (Q5042225) (← links)
- Rectangles Are Nonnegative Juntas (Q5892101) (← links)
- Exponential Separation of Information and Communication for Boolean Functions (Q5892102) (← links)
- Computing with Tangles (Q5892103) (← links)
- Efficient dynamic approximate distance oracles for vertex-labeled planar graphs (Q5915659) (← links)
- An efficient oracle for counting shortest paths in planar graphs (Q5918687) (← links)
- An efficient oracle for counting shortest paths in planar graphs (Q5970820) (← links)
- (Q6065424) (← links)
- Shortest-Path Queries in Geometric Networks (Q6065461) (← links)
- A novel pseudo‐polynomial approach for shortest path problems (Q6087148) (← links)
- Shortest beer path queries in outerplanar graphs (Q6103523) (← links)