{"id":"W2136139408","doi":"10.1109/iscc.2005.107","title":"New Algorithms for Maintaining All-Pairs Shortest Paths","year":2005,"lang":"en","type":"article","venue":"","topic":"Smart Parking Systems Research","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"K shortest path routing; Shortest path problem; Shortest Path Faster Algorithm; Constrained Shortest Path First; Yen's algorithm; Computer science; Algorithm; Average path length; Private Network-to-Network Interface; Floyd–Warshall algorithm; Link (geometry); Path (computing); Mathematical optimization; Routing (electronic design automation); Dijkstra's algorithm; Mathematics; Link-state routing protocol; Theoretical computer science; Routing protocol; Graph","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.002011427,0.00118082,0.001317611,0.001387099,0.001109725,0.001553715,0.004072336,0.001485285,0.003925635],"category_scores_gemma":[0.007326513,0.0006644274,0.0007137144,0.001250894,0.001221772,0.004441686,0.002285408,0.002221297,0.001113067],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00139366,"about_ca_system_score_gemma":0.001554967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002365811,"about_ca_topic_score_gemma":0.002500464,"domain_scores_codex":[0.9984784,0.0003107172,0.0001137522,0.0004475336,0.0005257615,0.0001238518],"domain_scores_gemma":[0.9972818,0.001185099,0.0003424295,0.0004921753,0.0005464765,0.0001520499],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001518648,0.0001288514,0.0005984655,0.0001867544,0.00007396942,0.00006867913,0.0001955128,0.5852803,0.002519214,0.1117042,0.005984758,0.2931074],"study_design_scores_gemma":[0.00004412097,0.00005275374,0.00007470218,0.00001514966,0.00001497864,0.00006946017,0.00002912458,0.952428,0.001368659,0.04008643,0.005798102,0.00001843744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002908307,0.0001473988,0.9953372,0.00008700929,0.00005851821,0.00004618592,0.00003180408,0.0003782753,0.001005213],"genre_scores_gemma":[0.1389265,0.0003980939,0.8548325,0.0001336383,0.0001307285,0.0003041327,0.000288297,0.0002345357,0.00475156],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004072336,"threshold_uncertainty_score":0.01313251,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03959676575859223,"score_gpt":0.3008941452229212,"score_spread":0.261297379464329,"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."}}