{"id":"W2046384546","doi":"10.1016/j.dam.2006.04.018","title":"Minimum edge ranking spanning trees of split graphs","year":2006,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Simon Fraser University; Ministry of Education, Culture, Sports, Science and Technology","keywords":"Mathematics; Combinatorics; Spanning tree; Minimum spanning tree; Discrete mathematics; Chordal graph; k-minimum spanning tree; Indifference graph; Time complexity; Graph; K-ary tree; Tree structure; Binary tree","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001043561,0.0006444357,0.00171735,0.001551173,0.001309759,0.00266026,0.001472101,0.001668973,0.00617509],"category_scores_gemma":[0.007437966,0.000921054,0.0005810659,0.002002444,0.000770889,0.004199411,0.001076978,0.001810132,0.001170594],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007238918,"about_ca_system_score_gemma":0.0007153903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005902982,"about_ca_topic_score_gemma":0.001679835,"domain_scores_codex":[0.9992678,0.0002209658,0.00004399132,0.0001754534,0.0001529336,0.0001389481],"domain_scores_gemma":[0.9947593,0.002649777,0.0007227752,0.0005833819,0.0006252003,0.0006596168],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001717866,0.0008286567,0.01058739,0.00163074,0.0003866785,0.001030918,0.002147349,0.1070571,0.03543485,0.5578475,0.03872707,0.242604],"study_design_scores_gemma":[0.0001083198,0.0001872276,0.003279747,0.00008262379,0.0001309075,0.0005464921,0.0006119841,0.1758249,0.003980456,0.8092255,0.005994873,0.00002698412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7312375,0.001273489,0.2456714,0.00129616,0.00009737041,0.000176905,0.002346526,0.0007586147,0.01714196],"genre_scores_gemma":[0.8353677,0.0008646022,0.1473979,0.000346037,0.0001270526,0.0001705603,0.00504966,0.0004340208,0.01024242],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00617509,"threshold_uncertainty_score":0.02065778,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01762151411447972,"score_gpt":0.2709471979207124,"score_spread":0.2533256838062327,"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."}}