{"id":"W2011204371","doi":"10.1145/2229163.2229166","title":"I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths","year":2012,"lang":"en","type":"article","venue":"ACM Transactions on Algorithms","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Combinatorics; Mathematics; Binary logarithm; Shortest path problem; Undirected graph; Spanning tree; Minimum spanning tree; Random graph; Path (computing); Bounded function; Enhanced Data Rates for GSM Evolution; Time complexity; Shortest-path tree; Discrete mathematics; Algorithm; Graph; Computer science","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009368731,0.001928339,0.001220648,0.001236544,0.0008554681,0.001298116,0.003063469,0.001183717,0.005099891],"category_scores_gemma":[0.007067981,0.0006329933,0.0009368057,0.002199797,0.000838219,0.004220094,0.002741643,0.001254412,0.002219047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001013611,"about_ca_system_score_gemma":0.00140308,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000893058,"about_ca_topic_score_gemma":0.001637365,"domain_scores_codex":[0.9983595,0.0003676164,0.0001287211,0.0004567195,0.000417947,0.0002694573],"domain_scores_gemma":[0.9965043,0.001579802,0.000459091,0.001000287,0.0002913258,0.000165255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007303155,0.0006780012,0.001702622,0.0008779319,0.0001456165,0.0002231697,0.0003086334,0.3528395,0.03248771,0.06356475,0.01781639,0.5286253],"study_design_scores_gemma":[0.000250477,0.0003292255,0.0003865868,0.00005310936,0.00007704356,0.0003736262,0.00009237145,0.8547023,0.02526562,0.1068507,0.01155578,0.00006310195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02680992,0.0008627041,0.9637966,0.0003982016,0.00007465348,0.0001739421,0.0003032456,0.002420829,0.005159867],"genre_scores_gemma":[0.2453755,0.0008896893,0.7471839,0.0002238086,0.0001226207,0.0003830449,0.000899138,0.0004913154,0.004430884],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005099891,"threshold_uncertainty_score":0.01706082,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04606075865658251,"score_gpt":0.2855441878667008,"score_spread":0.2394834292101183,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}