Pages that link to "Item:Q1900895"
From MaRDI portal
The following pages link to An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications (Q1900895):
Displayed 14 items.
- Algorithms for interval structures with applications (Q388095) (← links)
- Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh (Q631208) (← links)
- Cyclical scheduling and multi-shift scheduling: complexity and approximation algorithms (Q865749) (← links)
- Localized and compact data-structure for comparability graphs (Q1025540) (← links)
- Optimal parallel algorithms on circular-arc graphs (Q1263980) (← links)
- Unified all-pairs shortest path algorithms in the chordal hierarchy (Q1364781) (← links)
- All-pairs-shortest-length on strongly chordal graphs (Q1923609) (← links)
- Disconnected cuts in claw-free graphs (Q2186821) (← links)
- Algorithms for Interval Structures with Applications (Q3004669) (← links)
- Distance Labeling for Permutation Graphs (Q3439382) (← links)
- Optimally fast shortest path algorithms for some classes of graphs (Q4236113) (← links)
- Skeletons, recognition algorithm and distance matrix of quasi-median graphs (Q4847142) (← links)
- Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems (Q6040633) (← links)
- Intersection graphs of non-crossing paths (Q6041577) (← links)