scientific article; zbMATH DE number 7053319
From MaRDI portal
Publication:5743440
Recommendations
- Constant girth approximation for directed graphs in subquadratic time
- Separating sublinear time computations by approximate diameter
- Separating Sublinear Time Computations by Approximate Diameter
- Sublinear-time algorithms for approximating graph parameters
- Sublinear time algorithms for metric space problems
- Sublinear graph approximation algorithms
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- Sublinear-time Algorithms
- Sublinear time algorithms
- scientific article; zbMATH DE number 5057523
Cites work
- scientific article; zbMATH DE number 3340123 (Why is no real title available?)
- All-Pairs Almost Shortest Paths
- Approximate distance oracles
- Approximating the girth
- Approximation algorithms for cycle packing problems
- Color-coding
- Cycle bases in graphs characterization, algorithms, complexity, and applications
- Cycles of even length in graphs
- Efficient approximation algorithms for shortest cycles in undirected graphs
- Fast Estimation of Diameter and Shortest Paths (Without Matrix Multiplication)
- Faster algorithms for all-pairs approximate shortest paths in undirected graphs
- Faster algorithms for finding lowest common ancestors in directed acyclic graphs
- Finding Even Cycles Even Faster
- Finding a Minimum Circuit in a Graph
- Finding and counting given length cycles
- General context-free recognition in less than cubic time
- Matrix multiplication via arithmetic progressions
- Minimum Weight Cycles and Triangles: Equivalences and Algorithms
- Regularity Lemmas and Combinatorial Algorithms
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Subcubic equivalences between path, matrix, and triangle problems
- The Spatial Complexity of Oblivious k-Probe Hash Functions
Cited in
(9)- A distributed enumeration algorithm and applications to all pairs shortest paths, diameter\dots
- Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs
- scientific article; zbMATH DE number 7561542 (Why is no real title available?)
- On approximating the \(d\)-girth of a graph
- Approximating cycles in directed graphs: fast algorithms for girth and roundtrip spanners
- Minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths
- Fast distributed algorithms for girth, cycles and small subgraphs
- Computing the depth distribution of a set of boxes
- Efficient enumeration of subgraphs and induced subgraphs with bounded girth
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5743440)
