{"id":"W2082259377","doi":"10.1002/net.21590","title":"Formulations and exact solution approaches for the degree preserving spanning tree problem","year":2015,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal; Computer Research Institute of Montréal","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Spanning tree; Degree (music); Minimum spanning tree; Mathematical optimization; Tree (set theory); Mathematics; Computer science; Minimum degree spanning tree; Distributed minimum spanning tree; Combinatorics","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.002750209,0.001928433,0.0009946086,0.001286106,0.0006938279,0.002813861,0.002264143,0.001772615,0.00623301],"category_scores_gemma":[0.009639959,0.0009469994,0.001306014,0.00258785,0.001078699,0.004054203,0.001809184,0.004204781,0.0008638708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00191984,"about_ca_system_score_gemma":0.002605481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002524071,"about_ca_topic_score_gemma":0.00309272,"domain_scores_codex":[0.9978837,0.0007739303,0.0001294198,0.0003044135,0.0007030291,0.0002054803],"domain_scores_gemma":[0.9969259,0.002030907,0.0002965668,0.0003178401,0.0003586693,0.00007018417],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008196949,0.0002267301,0.0003998085,0.00044714,0.00005176328,0.0000798078,0.0001834154,0.5727537,0.001720345,0.2780154,0.004380669,0.1416593],"study_design_scores_gemma":[0.00003963643,0.00005590646,0.0001004553,0.000063744,0.00002348782,0.00006592645,0.00008366574,0.8426584,0.001175297,0.150527,0.005190363,0.00001606215],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002655867,0.000464919,0.9922932,0.0002414156,0.00003258549,0.00009232761,0.00009986889,0.00008818444,0.004031612],"genre_scores_gemma":[0.0789391,0.001949319,0.9152064,0.0002194737,0.0001440621,0.0004711377,0.0004892226,0.0001285796,0.002452686],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00623301,"threshold_uncertainty_score":0.02085149,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2254207703533971,"score_gpt":0.3143817814222265,"score_spread":0.08896101106882945,"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."}}