scientific article; zbMATH DE number 7561506
From MaRDI portal
Publication:5091161
DOI10.4230/LIPIcs.ICALP.2019.13MaRDI QIDQ5091161
Nicole Wein, Bertie Ancona, Liam Roditty, Monika R. Henzinger, Virginia Vassilevska Williams
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1811.12527
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Finding and counting given length cycles
- On the all-pairs-shortest-path problem in unweighted undirected graphs.
- Which problems have strongly exponential complexity?
- A new approach to all-pairs shortest paths on real-weighted graphs
- A new algorithm for optimal 2-constraint satisfaction and its implications
- Unifying and Strengthening Hardness for Dynamic Problems via the Online Matrix-Vector Multiplication Conjecture
- Powers of tensors and fast matrix multiplication
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- An On-Line Edge-Deletion Problem
- New Bounds for Approximating Extremal Distances in Undirected Graphs
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY
- Graph pattern detection: hardness for all induced patterns and faster non-induced cycles
- Towards tight approximation bounds for graph diameter and eccentricities
- Faster all-pairs shortest paths via circuit complexity
- Sublinear-time decremental algorithms for single-source reachability and shortest paths on directed graphs
- A Shortest Path Algorithm for Real-Weighted Undirected Graphs
- Better Approximation Algorithms for the Graph Diameter
- Multiplying matrices faster than coppersmith-winograd
- A new approach to dynamic all pairs shortest paths
- Fast approximation algorithms for the diameter and radius of sparse graphs
This page was built for publication:
