Efficient parameterized algorithms for computing all-pairs shortest paths
From MaRDI portal
Recommendations
- Efficient parameterized algorithms for computing all-pairs shortest paths
- Computing all-pairs shortest paths by leveraging low treewidth
- More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
- All-pairs shortest paths with real weights in \(O ( n^{3}/\log n )\) time
- Algorithms and Data Structures
Cited in
(10)- Sharing information for the all pairs shortest path problem
- All-Pairs Approximate Shortest Paths and Distance Oracle Preprocessing
- Efficient parameterized algorithms for computing all-pairs shortest paths
- Maximum matching in almost linear time on graphs of bounded clique-width
- Twin-width. III: Max independent set, min dominating set, and coloring
- An efficient algorithm to determine all shortest paths in Sierpiński graphs
- Optimal centrality computations within bounded clique-width graphs
- A priority queue for the all pairs shortest path problem
- scientific article; zbMATH DE number 1043917 (Why is no real title available?)
- Optimal centrality computations within bounded clique-width graphs
This page was built for publication: Efficient parameterized algorithms for computing all-pairs shortest paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874311)
