Directed shortest paths via approximate cost balancing

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A note on two problems in connexion with graphs
New scaling algorithms for the assignment and minimum mean cycle problems
A characterization of the minimum cycle mean in a digraph
Approximate binary search algorithms for mean cuts and cycles
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
A new approach to all-pairs shortest paths on real-weighted graphs
Balancing a matrix for calculation of eigenvalues and eigenvectors
Undirected single-source shortest paths with positive integer weights in linear time
Sensitivity Analysis of Minimum Spanning Trees in Sub-Inverse-Ackermann Time
On Pre-Conditioning of Matrices
Max-Balancing Weighted Directed Graphs and Matrix Scaling
New Bounds on the Complexity of the Shortest Path Problem
Matrix Balancing in L_p Norms: Bounding the Convergence Rate of Osborne's Iteration
An O(nm) time algorithm for finding the min length directed cycle in a graph
Analysis of a Classical Matrix Preconditioning Algorithm
Scaling Algorithms for the Shortest Paths Problem
Deterministic APSP, Orthogonal Vectors, and More
Fibonacci heaps and their uses in improved network optimization algorithms
Faster all-pairs shortest paths via circuit complexity
A Shortest Path Algorithm for Real-Weighted Undirected Graphs
Depth-First Search and Linear Graph Algorithms
A Theorem on Boolean Matrices
Faster parametric shortest path and minimum‐balance algorithms
Integer priority queues with decrease key in constant time and the single source shortest paths problem

This page was built for publication: Directed shortest paths via approximate cost balancing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567263)