{"id":"W2117946984","doi":"10.5555/1109557.1109614","title":"All-pairs shortest paths for unweighted undirected graphs in o(mn) time","year":2006,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Undirected graph; Mathematics; Graph; Discrete mathematics","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.001202245,0.001859065,0.001960152,0.001405158,0.00141819,0.002798114,0.003069529,0.001720179,0.01070087],"category_scores_gemma":[0.006695549,0.0008063376,0.00132104,0.002618945,0.001020083,0.01198563,0.003227974,0.00168361,0.001931953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001791402,"about_ca_system_score_gemma":0.001821012,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002632958,"about_ca_topic_score_gemma":0.00366877,"domain_scores_codex":[0.9977049,0.0006224159,0.0001982701,0.000717767,0.0004480242,0.0003085955],"domain_scores_gemma":[0.9949217,0.003055748,0.0004077463,0.0009594872,0.0003757557,0.0002795336],"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.001449799,0.0006386881,0.002160688,0.003194699,0.0003220214,0.0004337737,0.0009714694,0.2292127,0.0201717,0.0925651,0.04374271,0.6051366],"study_design_scores_gemma":[0.0005701259,0.0003288185,0.001020778,0.0001494361,0.0001690363,0.0007477329,0.0008252913,0.5502557,0.01582901,0.4042202,0.02578851,0.0000952746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.14706,0.001760361,0.8268509,0.002646235,0.0003397853,0.0009120909,0.002359164,0.004165231,0.01390626],"genre_scores_gemma":[0.2517799,0.001104277,0.7343082,0.000284824,0.0001893559,0.0004439826,0.00367399,0.0007863069,0.007429181],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01070087,"threshold_uncertainty_score":0.03579801,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01560847232180834,"score_gpt":0.2342218529718607,"score_spread":0.2186133806500523,"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."}}