{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000706478,0.0008701195,0.001039292,0.001051208,0.001262601,0.001424042,0.001577822,0.001013726,0.006469944],"category_scores_gemma":[0.004013376,0.0005830022,0.0006170845,0.002031167,0.0009878281,0.002553087,0.001538056,0.001408241,0.001023421],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00149391,"about_ca_system_score_gemma":0.002354826,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01440484,"about_ca_topic_score_gemma":0.03113026,"domain_scores_codex":[0.999447,0.0001642249,0.00002645837,0.0001102493,0.0001503183,0.0001016667],"domain_scores_gemma":[0.9986522,0.000635706,0.0001043712,0.0003431552,0.0001796074,0.00008491371],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002049144,0.000114006,0.0008088294,0.0002058795,0.00004839848,0.00007586534,0.0001192641,0.7453462,0.003649169,0.07354121,0.0112732,0.164613],"study_design_scores_gemma":[0.00002969889,0.00001730978,0.0001721753,0.000006202257,0.00001030504,0.00001702732,0.0000325341,0.9178963,0.0008435672,0.07853391,0.002435074,0.000005978582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.064417,0.000844715,0.9191627,0.001170077,0.0001606093,0.0001661405,0.0002572788,0.00269092,0.01113058],"genre_scores_gemma":[0.340504,0.000582148,0.647675,0.0002162747,0.00009168343,0.0002300635,0.0006417081,0.000390181,0.009668946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01440484,"threshold_uncertainty_score":0.028642,"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."}}