{"id":"W108520386","doi":"","title":"Bi-Chromatic Minimum Spanning Trees","year":2005,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"","keywords":"Spanning tree; Combinatorics; Mathematics; Minimum spanning tree; Minimum degree spanning tree; Planar; Disjoint sets; Planar graph; Connected dominating set; Chromatic scale; Greedy algorithm; Discrete mathematics; Graph; Algorithm; Computer science","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.0005503758,0.0006452174,0.0004711741,0.001029913,0.0008820258,0.001119437,0.001311422,0.0006576913,0.005652155],"category_scores_gemma":[0.004276237,0.0003978183,0.000320693,0.001640363,0.0005075507,0.002366921,0.001776929,0.0008328953,0.001499182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006764221,"about_ca_system_score_gemma":0.0005493959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001244823,"about_ca_topic_score_gemma":0.003119282,"domain_scores_codex":[0.9994559,0.0001013825,0.00003278994,0.000126077,0.0001638239,0.0001201206],"domain_scores_gemma":[0.9981504,0.0006757256,0.00023429,0.0003628803,0.0003700597,0.000206608],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0008463296,0.0002108723,0.005386419,0.0008156241,0.0001533032,0.0005275357,0.00065125,0.2625484,0.05507046,0.3726377,0.02806342,0.2730886],"study_design_scores_gemma":[0.0001180196,0.0002054506,0.00307967,0.00009024307,0.000090931,0.0007347507,0.0003873048,0.5052764,0.009822257,0.4442127,0.03593357,0.00004869957],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.17243,0.001105114,0.7874965,0.000828328,0.00009479092,0.0001743725,0.001842174,0.0009066729,0.03512213],"genre_scores_gemma":[0.573454,0.001310834,0.4056002,0.0003093302,0.00008778526,0.0002481283,0.004367779,0.0002483177,0.01437365],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005652155,"threshold_uncertainty_score":0.01890838,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01719207396910605,"score_gpt":0.2509931357309643,"score_spread":0.2338010617618583,"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."}}