scientific article
From MaRDI portal
Publication:3002808
DOI10.4086/toc.2009.v005a009zbMath1213.68338OpenAlexW2171019266MaRDI QIDQ3002808
Raphael Yuster, Virginia Vassilevska Williams, R. Ryan Williams
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2009.v005a009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Unnamed Item, Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication., Improved Time Bounds for All Pairs Non-decreasing Paths in General Digraphs, More on change-making and related problems, Dynamic Approximate All-Pairs Shortest Paths: Breaking the $O(mn)$ Barrier and Derandomization, Hamming Distance Completeness, Faster Algorithms for All Pairs Non-Decreasing Paths Problem, Variations on the bottleneck paths problem, Dominance Product and High-Dimensional Closest Pair under L_infty
