{"id":"W2012042319","doi":"10.1007/s00453-001-0109-4","title":"Efficient Parallel Graph Algorithms for Coarse-Grained Multicomputers and BSP","year":2002,"lang":"en","type":"article","venue":"Algorithmica","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Algorithm; Binary logarithm; Parallel computing; Parallel algorithm; Theory of computation; Overhead (engineering); Spanning tree; Computation; Tree (set theory); Combinatorics; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000277893,0.0002183964,0.000274741,0.0001456076,0.0002613118,0.0002133297,0.000471718,0.00009980884,0.00001214192],"category_scores_gemma":[0.00002060409,0.0001941089,0.0001423476,0.0002653476,0.00007072223,0.0001082902,0.0001335527,0.0001182564,0.00003238243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003264739,"about_ca_system_score_gemma":0.000008054433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003188637,"about_ca_topic_score_gemma":0.000003354564,"domain_scores_codex":[0.9983458,0.00006329615,0.0003459908,0.0005753368,0.000214539,0.0004550435],"domain_scores_gemma":[0.9989583,0.0002209504,0.0001077604,0.0004272026,0.0001163265,0.0001694155],"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.00002841852,0.0005792443,0.00006312162,0.00009434238,0.0002829102,0.00006646606,0.005007192,0.02334917,0.0002246625,0.06858613,0.04745033,0.854268],"study_design_scores_gemma":[0.001049234,0.0001606565,0.00005843106,0.00002415695,0.000008155002,0.00006884555,0.00004189129,0.9880084,0.0000397314,0.0006838629,0.009599156,0.000257467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002723296,0.0003451262,0.9930269,0.001227919,0.001560814,0.0005016419,0.000007742383,0.0002317823,0.0003747634],"genre_scores_gemma":[0.5148204,0.00002859881,0.4826022,0.000857433,0.0005905905,0.00015775,0.000005460214,0.00003208567,0.0009055148],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9646592,"threshold_uncertainty_score":0.791553,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0279442320030997,"score_gpt":0.2374121101943307,"score_spread":0.209467878191231,"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."}}