{"id":"W2106960349","doi":"10.1109/reldis.1998.740525","title":"Practical parallel algorithms for minimum spanning trees","year":2002,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Spanning tree; Minimum spanning tree; Computer science; Undirected graph; Computation; Graph algorithms; Graph theory; Parallel algorithm; Graph; Prim's algorithm; Simple (philosophy); Algorithm; Efficient algorithm; Distributed minimum spanning tree; Combinatorics; Theoretical computer science; 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.001292851,0.0008299327,0.0007047642,0.0007030865,0.0008916428,0.001192804,0.001449206,0.001070688,0.004205378],"category_scores_gemma":[0.01051814,0.0004966375,0.0005013384,0.001999561,0.0009745492,0.003457888,0.00100992,0.001000137,0.0009860444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001136864,"about_ca_system_score_gemma":0.001022974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009391042,"about_ca_topic_score_gemma":0.001296124,"domain_scores_codex":[0.998882,0.0003950402,0.00006190834,0.0002257387,0.0003209348,0.0001144311],"domain_scores_gemma":[0.9967716,0.002125035,0.0002478035,0.0004244332,0.0003546451,0.00007640485],"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.0002624742,0.0002200711,0.001278161,0.0005372863,0.00008426819,0.0001608864,0.0002570269,0.5922781,0.0057432,0.2232926,0.009381846,0.166504],"study_design_scores_gemma":[0.0000740414,0.00006456294,0.0001762881,0.00001710441,0.00001559386,0.000134364,0.00005544788,0.7868509,0.001668666,0.2067345,0.004201311,0.000007233743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05534641,0.001085547,0.9294065,0.0007959583,0.00008384819,0.0001676853,0.0001171421,0.0009283544,0.0120686],"genre_scores_gemma":[0.4488748,0.001165987,0.5451282,0.0001657396,0.0001373337,0.0003302374,0.0004586826,0.000221063,0.003518036],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004205378,"threshold_uncertainty_score":0.01406837,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1302220273397589,"score_gpt":0.3311332125426399,"score_spread":0.200911185202881,"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."}}