scientific article; zbMATH DE number 7053319
From MaRDI portal
Publication:5743440
zbMath1423.05183MaRDI QIDQ5743440
Liam Roditty, Virginia Vassilevska Williams
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095183
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (5)
Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths ⋮ Unnamed Item ⋮ Computing the depth distribution of a set of boxes ⋮ Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs ⋮ A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Finding and counting given length cycles
- Matrix multiplication via arithmetic progressions
- Efficient approximation algorithms for shortest cycles in undirected graphs
- General context-free recognition in less than cubic time
- Cycles of even length in graphs
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs
- The Spatial Complexity of Oblivious k-Probe Hash Functions
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Finding a Minimum Circuit in a Graph
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- Finding Even Cycles Even Faster
- Color-coding
- Subcubic Equivalences Between Path, Matrix, and Triangle Problems
- All-Pairs Almost Shortest Paths
- Regularity Lemmas and Combinatorial Algorithms
- Approximate distance oracles
- Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
- Minimum Weight Cycles and Triangles: Equivalences and Algorithms
This page was built for publication:
