{"id":"W2140883685","doi":"10.1016/s0166-218x(02)00217-2","title":"An external memory data structure for shortest path queries","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Combinatorics; Mathematics; Shortest path problem; Distance; sort; Planar graph; Data structure; Path (computing); Graph; Spanning tree; Binary logarithm; Binary tree; Discrete mathematics; Computer science; Arithmetic","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.001415009,0.0009624523,0.001313057,0.002251749,0.001373318,0.002726507,0.002864398,0.001073979,0.01391497],"category_scores_gemma":[0.007925829,0.0006943031,0.0006334991,0.004923969,0.001105469,0.00582368,0.005466529,0.001795711,0.004135741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0012982,"about_ca_system_score_gemma":0.001545372,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001392139,"about_ca_topic_score_gemma":0.001872651,"domain_scores_codex":[0.9986255,0.0002081233,0.0002285083,0.0002007499,0.0005507221,0.0001863999],"domain_scores_gemma":[0.9938722,0.001361897,0.0003725366,0.003265374,0.0008381282,0.0002899819],"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.003153495,0.00044809,0.003207593,0.0007513898,0.0001121002,0.0003692252,0.0006244819,0.01995168,0.02582273,0.1473557,0.1023759,0.6958277],"study_design_scores_gemma":[0.001228263,0.001209191,0.001914403,0.0004222945,0.000300088,0.001046002,0.0006987203,0.3248118,0.09001075,0.3553251,0.2227808,0.000252551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.064683,0.001991238,0.8827587,0.001836416,0.0007796794,0.0005947325,0.00623861,0.02535287,0.01576471],"genre_scores_gemma":[0.3875247,0.001139979,0.5640869,0.001169005,0.0004857772,0.001365311,0.01647097,0.003469734,0.02428764],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01391497,"threshold_uncertainty_score":0.04655021,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03890792014784756,"score_gpt":0.2760937952615219,"score_spread":0.2371858751136744,"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."}}