{"id":"W1601919219","doi":"10.1007/3-540-44679-6_30","title":"A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Transitive closure; Computer science; Closure (psychology); Algorithm; Path (computing); Shortest path problem; Space (punctuation); Transitive relation; Theoretical computer science; Discrete mathematics; Mathematics; Combinatorics; Graph; Computer network","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.001360637,0.001842539,0.001447084,0.001944565,0.001809457,0.002659151,0.002846471,0.001290956,0.01649924],"category_scores_gemma":[0.009080548,0.0009182526,0.001884417,0.00390441,0.002503151,0.01173608,0.003968306,0.006477428,0.006176961],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009108311,"about_ca_system_score_gemma":0.0008859493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001161792,"about_ca_topic_score_gemma":0.001704629,"domain_scores_codex":[0.9981164,0.0004330135,0.0001579629,0.0004455701,0.0006852181,0.0001618649],"domain_scores_gemma":[0.99608,0.00172719,0.0001230198,0.001661839,0.0003050077,0.0001029531],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002243328,0.0001978373,0.0002530568,0.0004056091,0.00006177817,0.0002329635,0.0004344708,0.0136375,0.006793215,0.5367151,0.04420033,0.3968438],"study_design_scores_gemma":[0.00007361649,0.00006274172,0.0001364666,0.0000738844,0.00005405049,0.000383875,0.0001077786,0.06143814,0.005278216,0.8808827,0.05145327,0.00005526682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00389508,0.0006257383,0.9771985,0.0007706746,0.0004898804,0.00008771453,0.0002675228,0.001674424,0.01499037],"genre_scores_gemma":[0.09961508,0.001385816,0.8748246,0.000629979,0.0005398307,0.0003793076,0.0008509787,0.002287747,0.01948671],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01649924,"threshold_uncertainty_score":0.05519551,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01245145183433207,"score_gpt":0.2454966569590938,"score_spread":0.2330452051247617,"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."}}