301 search results - page 61 / 61 » Job Sequencing with Exponential Functions of Processing Time... |
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...