{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002001792,0.0001399343,0.0001623443,0.00008786461,0.000209765,0.0002109787,0.0005658703,0.00006023542,0.000180823],"category_scores_gemma":[0.00009493213,0.0001228056,0.0001293938,0.000268688,0.00006424092,0.0005568338,0.0001834807,0.0001194186,0.0001036553],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001417447,"about_ca_system_score_gemma":0.0000148647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001004753,"about_ca_topic_score_gemma":0.000007852241,"domain_scores_codex":[0.9987398,0.00003035528,0.0002114508,0.000403475,0.0002303053,0.0003846149],"domain_scores_gemma":[0.9989163,0.0004015315,0.0000547827,0.0004407521,0.00006486767,0.0001217166],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005388693,0.000284698,0.00006458149,0.00001043581,0.00003564472,0.00002971796,0.00053427,0.00005698851,0.00005164353,0.7242036,0.08683643,0.1878866],"study_design_scores_gemma":[0.0004510306,0.0001487261,0.0001757999,0.000007105837,0.000005457372,0.00004812418,0.00004672382,0.9081383,0.0001193378,0.02019813,0.07044895,0.0002123216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001332952,0.0001299474,0.9819331,0.008871618,0.0004061265,0.0001873596,0.000002193613,0.0002794199,0.008056955],"genre_scores_gemma":[0.01523898,0.00001839738,0.9790617,0.0005852446,0.0001937402,0.00004244649,0.000001428541,0.000008691052,0.004849408],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9080813,"threshold_uncertainty_score":0.5007865,"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."}}