Fully dynamic algorithms for minimum weight cycle and related problems
From MaRDI portal
Cites work
- A new approach to all-pairs shortest paths on real-weighted graphs
- A new approach to dynamic all pairs shortest paths
- Algorithm Theory - SWAT 2004
- Algorithmic applications of Baur-Strassen's theorem, shortest cycles, diameter, and matchings
- Algorithms and hardness for diameter in dynamic graphs
- All pairs shortest paths using bridging sets and rectangular matrix multiplication
- An O(n n) algorithm for maximum st-flow in a directed planar graph
- An O(nm) time algorithm for finding the min length directed cycle in a graph
- Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max
- Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs
- Conditionally optimal approximation algorithms for the girth of a directed graph
- Constant girth approximation for directed graphs in subquadratic time
- Deterministic Algorithms for Decremental Approximate Shortest Paths: Faster and Simpler
- Dynamic approximate all-pairs shortest paths in undirected graphs
- Dynamic approximate all-pairs shortest paths: breaking the \(O(mn)\) barrier and derandomization
- Efficient Algorithms for Shortest Paths in Sparse Networks
- Finding a Minimum Circuit in a Graph
- Fully dynamic (2 + ε) approximate all-pairs shortest paths with fast query and close to linear update time
- Fully dynamic all-pairs shortest paths with worst-case update-time revisited
- Fully-Dynamic All-Pairs Shortest Paths: Improved Worst-Case Time and Space Bounds
- scientific article; zbMATH DE number 6850341 (Why is no real title available?)
- scientific article; zbMATH DE number 6297748 (Why is no real title available?)
- scientific article; zbMATH DE number 7788357 (Why is no real title available?)
- scientific article; zbMATH DE number 7788485 (Why is no real title available?)
- Improved algorithms for \textsc{Min-cut} and \textsc{Max-flow} in undirected planar graphs
- Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths
- Improved dynamic algorithms for maintaining approximate shortest paths under deletions
- Incremental algorithms for minimal length paths
- Maintaining shortest paths under deletions in weighted directed graphs
- Min-cuts and shortest cycles in planar graphs in O(n n) time
- Minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths
- Minimum Weight Cycles and Triangles: Equivalences and Algorithms
- Multiple-source shortest paths in planar graphs
- Near-optimal approximate decremental all pairs shortest paths
- On dynamic shortest paths problems
- Planar graphs, negative weight edges, shortest paths, and near linear time
- Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs
- Scaling algorithms for network problems
- Simple label-correcting algorithms for partially dynamic approximate shortest paths in directed graphs
- Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs.
- Subcubic equivalences between path, matrix, and triangle problems
- Submatrix maximum queries in Monge matrices and partial Monge matrices, and their applications
- Tight hardness for shortest cycles and paths in sparse graphs
- Which problems have strongly exponential complexity?
- Worst-case update times for fully-dynamic all-pairs shortest paths
This page was built for publication: Fully dynamic algorithms for minimum weight cycle and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241182)
