Improved girth approximation in weighted undirected graphs
From MaRDI portal
Cites work
- A forward-backward single-source shortest paths algorithm
- A New Algorithm for Finding All Shortest Paths in a Graph of Positive Arcs in Average Time O(n^2 \log ^2 n)
- A new approach to all-pairs shortest paths on real-weighted graphs
- A note on two problems in connexion with graphs
- Algorithmic trade-offs for girth approximation in undirected graphs
- Almost all graphs with high girth and suitable density have high chromatic number
- Approximate distance oracles
- Approximating the girth
- Efficient approximation algorithms for shortest cycles in undirected graphs
- Faster all-pairs shortest paths via circuit complexity
- Faster Approximation Algorithms for Computing Shortest Cycles on Weighted Graphs
- Filtering Search: A New Approach to Query-Answering
- Finding a Minimum Circuit in a Graph
- Finding and counting given length cycles
- Finding Even Cycles Even Faster
- scientific article; zbMATH DE number 3258067 (Why is no real title available?)
- scientific article; zbMATH DE number 7053319 (Why is no real title available?)
- Minimum Weight Cycles and Triangles: Equivalences and Algorithms
- Networks, crowds and markets. Reasoning about a highly connected world.
- New Data Structures for Orthogonal Range Queries
- On the structure of extremal graphs of high girth
- Priority Search Trees
- Properties of regular graphs with large girth via local algorithms
- Subcubic equivalences between path, matrix, and triangle problems
- Tight hardness for shortest cycles and paths in sparse graphs
This page was built for publication: Improved girth approximation in weighted undirected graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7305200)
