{"id":"W1554407673","doi":"10.1109/sffcs.1999.814580","title":"Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":228,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Transitive closure; Amortized analysis; Combinatorics; Binary logarithm; Integer (computer science); Algorithm; Mathematics; Shortest path problem; Closure (psychology); Discrete mathematics; Data structure; Time complexity; Computer science; 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.001191873,0.0009509433,0.001084401,0.001694891,0.001414305,0.002045583,0.00306846,0.000753486,0.003444087],"category_scores_gemma":[0.00729355,0.0009696217,0.0007884718,0.002649212,0.001150824,0.007363448,0.002885609,0.001189408,0.001083429],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001303924,"about_ca_system_score_gemma":0.001588348,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002571232,"about_ca_topic_score_gemma":0.003411192,"domain_scores_codex":[0.9978487,0.0004254262,0.0002175369,0.0006456822,0.000626916,0.0002357453],"domain_scores_gemma":[0.9935746,0.002299522,0.0006438242,0.002592148,0.0006525837,0.0002372734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007038862,0.0002833366,0.002809973,0.0008715009,0.0002000952,0.000253288,0.0007488679,0.1297161,0.02149008,0.1648064,0.01568234,0.6624342],"study_design_scores_gemma":[0.0002211614,0.0003628201,0.001097067,0.00009377371,0.0001523901,0.0009840234,0.0003495505,0.5536904,0.03012653,0.3683909,0.04439881,0.0001325885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03435742,0.0006861492,0.9556017,0.0002543257,0.0000554948,0.0002349964,0.001271606,0.003731861,0.003806498],"genre_scores_gemma":[0.3106459,0.0006096452,0.6814339,0.0001433202,0.00006334409,0.0003609674,0.003353023,0.000504707,0.002885226],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003444087,"threshold_uncertainty_score":0.01152158,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02292567693488149,"score_gpt":0.2702413490047282,"score_spread":0.2473156720698468,"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."}}