2 papers
cs.DS2025
An efficient implementation for solving the all pairs minimax path problem in an undirected dense graph
Gangli Liu
We provide an efficient implementation for solving the all pairs minimax path problem or widest path problem in an undirected dense graph. It is a code implementation of…
cs.DS2025
Solving the all pairs shortest path problem after minor update of a large dense graph
Gangli Liu
The all pairs shortest path problem is a fundamental optimization problem in graph theory. We deal with re-calculating the all-pairs shortest path (APSP) matrix after a minor modif…