scientific article; zbMATH DE number 913360
From MaRDI portal
Publication:4887753
Recommendations
- An optimal algorithm to solve the all-pair shortest path problem on interval graphs
- A simplified algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time
- A simpler algorithm for the all pairs shortest path problem with \(O(n ^{2} \log n)\) expected time
- O(1) QUERY TIME ALGORITHM FOR ALL PAIRS SHORTEST DISTANCES ON INTERVAL GRAPHS
- An All Pairs Shortest Path Algorithm with Expected Time $O(n^2 \log n)$
- scientific article; zbMATH DE number 3908469
- All-pairs nearly 2-approximate shortest paths in \(O(n^2 \text{ polylog } n)\) time
- scientific article; zbMATH DE number 1140072
- STACS 2005
- Solving the all-pair shortest path query problem on interval and circular-arc graphs
Cited in
(11)- An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs
- An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
- All-shortest-path 2-interval routing is NP-complete
- A survey of the all-pairs shortest paths problem and its variants in graphs
- Solving the all-pairs-shortest-length problem on chordal bipartite graphs
- Optimal parallel algorithm for shortest-paths problem on interval graphs
- An optimal algorithm to solve the all-pair shortest path problem on interval graphs
- scientific article; zbMATH DE number 1140072 (Why is no real title available?)
- Solving the all-pair shortest path query problem on interval and circular-arc graphs
- O(1) QUERY TIME ALGORITHM FOR ALL PAIRS SHORTEST DISTANCES ON INTERVAL GRAPHS
- \(O(1)\) query time algorithm for all pairs shortest distances on permutation graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887753)
