{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003266749,0.0001378896,0.0001563701,0.0001009046,0.00004181813,0.000063913,0.0001896073,0.00007876771,0.0003297541],"category_scores_gemma":[0.00004392668,0.0001339709,0.00006890957,0.0001184553,0.000009192825,0.0001189793,0.00002891905,0.0001221476,0.0002674791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001463991,"about_ca_system_score_gemma":0.00003532847,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000671256,"about_ca_topic_score_gemma":0.00008608763,"domain_scores_codex":[0.9988895,0.0000116225,0.0002202981,0.0001805715,0.0002137772,0.0004842197],"domain_scores_gemma":[0.9993935,0.0001477545,0.00001054237,0.0002382629,0.0000326848,0.000177242],"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.00001385501,0.00003179178,0.002689416,0.00007833028,0.0002749822,0.00002347411,0.001120839,0.09783354,0.006268757,0.003544752,0.3723454,0.5157748],"study_design_scores_gemma":[0.000429149,0.00004490693,0.0003907992,0.00002666382,0.000007631396,0.00002468762,0.0001528003,0.513553,0.003801476,0.00007822914,0.481249,0.0002416567],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01101261,0.0004464825,0.9033723,0.0006153045,0.000741006,0.0008607145,0.00001082622,0.001683014,0.08125769],"genre_scores_gemma":[0.9100014,0.00001233645,0.08125269,0.00007740015,0.001373559,0.00008614592,0.00001370097,0.00008134454,0.007101424],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8989888,"threshold_uncertainty_score":0.5463175,"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."}}