Pages that link to "Item:Q4406310"

The following pages link to Polylog-time and near-linear work approximation scheme for undirected shortest paths (Q4406310):

Displaying 10 items.

• Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs (Q487267) (← links)
• All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time (Q1001904) (← links)
• Thorup-Zwick emulators are universally optimal hopsets (Q1628677) (← links)
• On efficient distributed construction of near optimal routing schemes (Q1741966) (← links)
• NP-hardness and fixed-parameter tractability of the minimum spanner problem (Q1784745) (← links)
• Graph spanners: a tutorial review (Q2026289) (← links)
• Fast approximate shortest paths in the congested clique (Q2064057) (← links)
• Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← links)
• (Q5092347) (← links)
• Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions (Q6154194) (← links)