Pages that link to "Item:Q3366282"
From MaRDI portal
The following pages link to Optimal parallel algorithm for shortest-paths problem on interval graphs (Q3366282):
Displaying 10 items.
- Algorithms for interval structures with applications (Q388095) (← links)
- Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656) (← links)
- A highly parallel algorithm, for multistage optimization problems and shortest path problems (Q809604) (← links)
- A simple optimal parallel algorithm for the minimum coloring problem on interval graphs (Q1313723) (← links)
- An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications (Q1900895) (← links)
- An optimal algorithm to solve the all-pair shortest path problem on interval graphs (Q3989542) (← links)
- (Q4005371) (← links)
- Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph (Q4870967) (← links)
- (Q5129335) (← links)
- (Q5691919) (← links)