Pages that link to "Item:Q4302832"
From MaRDI portal
The following pages link to Planar graph decomposition and all pairs shortest paths (Q4302832):
Displaying 20 items.
- Linear-size planar Manhattan network for convex point sets (Q824337) (← links)
- Two fast algorithms for all-pairs shortest paths (Q875428) (← links)
- Area-efficient planar straight-line drawings of outerplanar graphs (Q885284) (← links)
- Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs (Q891679) (← links)
- Efficient parallel algorithms for shortest paths in planar digraphs (Q1196454) (← links)
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q1351004) (← links)
- An external memory data structure for shortest path queries (Q1861568) (← links)
- Searching among intervals and compact routing tables (Q1913700) (← links)
- Shortest-Path Queries in Planar Graphs on GPU-Accelerated Architectures (Q3304759) (← links)
- (Q4607877) (← links)
- Searching among intervals and compact routing tables (Q4630246) (← links)
- Shortest path queries in digraphs of small treewidth (Q4645182) (← links)
- Fast algorithms for maintaining shortest paths in outerplanar and planar digraphs (Q5055890) (← links)
- Efficient parallel algorithms for shortest paths in planar graphs (Q5056111) (← links)
- On the computation of fast data transmissions in networks with capacities and delays (Q5057443) (← links)
- Computing the all-pairs longest chains in the plane (Q5060093) (← links)
- A dynamic separator algorithm (Q5060105) (← links)
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems (Q5096905) (← links)
- Refined Vertex Sparsifiers of Planar Graphs (Q5208742) (← links)
- Many distances in planar graphs (Q5920250) (← links)