scientific article; zbMATH DE number 7051206

zbMath1423.05167MaRDI QIDQ4633847

Ran Duan, Seth Pettie

Publication date: 6 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=1496813

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Related Items (19)

Unnamed Item ⋮ Algebraic theory on shortest paths for all flows ⋮ Unnamed Item ⋮ Connected graph partitioning with aggregated and non‐aggregated gap objective functions ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. ⋮ Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs ⋮ Single-Source Bottleneck Path Algorithm Faster than Sorting for Sparse Graphs. ⋮ Approximating All-Pair Bounded-Leg Shortest Path and APSP-AF in Truly-Subcubic Time ⋮ A review of two network curvature measures ⋮ Improved distance sensitivity oracles with subcubic preprocessing time ⋮ On Cartesian trees and range minimum queries ⋮ More on change-making and related problems ⋮ Hamming Distance Completeness ⋮ Faster Algorithms for All Pairs Non-Decreasing Paths Problem ⋮ On Computing the Gromov Hyperbolicity ⋮ Variations on the bottleneck paths problem ⋮ Computing the Gromov hyperbolicity of a discrete metric space ⋮ Dominance Product and High-Dimensional Closest Pair under L_infty

This page was built for publication: