{"id":"W4409898124","doi":"10.1142/s0129054125500054","title":"Efficiently Enumerating Spanning Trees of <i>k</i> -Trees","year":2025,"lang":"en","type":"article","venue":"International Journal of Foundations of Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Brock University","funders":"Bangladesh University of Engineering and Technology","keywords":"Spanning tree; Combinatorics; Mathematics; Minimum degree spanning tree; Weight-balanced tree; Tree (set theory); Discrete mathematics; Trémaux tree; Graph; Binary tree; Binary search tree; Line graph; Pathwidth","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.00159359,0.0001020346,0.000222206,0.001501406,0.0001575335,0.0002588228,0.004229794,0.00002326316,0.000006711785],"category_scores_gemma":[0.0004287358,0.00009236283,0.0001329281,0.001662261,0.0006617886,0.001764791,0.0007036853,0.0001716996,0.000001942316],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000911352,"about_ca_system_score_gemma":0.00074998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007025547,"about_ca_topic_score_gemma":0.000005219811,"domain_scores_codex":[0.9974107,0.00007148842,0.0007727151,0.0002294744,0.001316943,0.0001986347],"domain_scores_gemma":[0.9952984,0.0004918252,0.0006938919,0.0003683628,0.003079068,0.00006848068],"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.00004227172,0.0003266998,0.005036994,0.00001503022,0.0001336632,0.00001629807,0.001198674,0.07718328,0.05700637,0.5618893,0.0001793027,0.2969722],"study_design_scores_gemma":[0.001987496,0.0006963593,0.04768099,0.001223246,0.00002681608,0.0002107302,0.0001785116,0.6472641,0.1933834,0.1045153,0.002451192,0.0003818225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09611526,0.0001136821,0.9004197,0.0009539676,0.001548997,0.00005868609,0.000002031245,0.00001230205,0.0007753877],"genre_scores_gemma":[0.7502592,0.00001164002,0.249567,0.00006776868,0.00005941514,8.444605e-7,3.638898e-7,0.000002272388,0.00003153004],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6541439,"threshold_uncertainty_score":0.7860079,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01778128091057472,"score_gpt":0.3485295082599452,"score_spread":0.3307482273493705,"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."}}