{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004281152,0.0006513921,0.0008163144,0.001055772,0.0007709607,0.001124986,0.001082206,0.0007827854,0.003336987],"category_scores_gemma":[0.003776188,0.000471858,0.0007681429,0.001808068,0.0004465367,0.003226233,0.001215147,0.0006554633,0.001355873],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006853503,"about_ca_system_score_gemma":0.001382712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002025633,"about_ca_topic_score_gemma":0.004213348,"domain_scores_codex":[0.9993935,0.0001133771,0.00007284136,0.0001377174,0.0001464038,0.0001361897],"domain_scores_gemma":[0.9982931,0.0008271267,0.0002473052,0.0002413572,0.0002636261,0.0001275214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008497285,0.00036791,0.01345081,0.001955946,0.0002219654,0.001091449,0.001087312,0.1656205,0.05931531,0.06751179,0.0445249,0.6440024],"study_design_scores_gemma":[0.000143961,0.0002673746,0.003361895,0.0001527356,0.0001264285,0.001354769,0.0007147195,0.756389,0.03112065,0.1880038,0.01829932,0.00006538194],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3307822,0.001763077,0.6385591,0.001129242,0.00016012,0.000366671,0.003030719,0.006805423,0.01740343],"genre_scores_gemma":[0.4347154,0.0005059478,0.5536853,0.000210553,0.00003980552,0.0001660789,0.005802292,0.0005913968,0.004283257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003336987,"threshold_uncertainty_score":0.01116335,"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."}}