{"id":"W2756194846","doi":"10.1109/compsac.2017.128","title":"Finding All Breadth First Full Spanning Trees in a Directed Graph","year":2017,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Tree traversal; Spanning tree; Graph traversal; Computer science; Graph; Combinatorics; Directed graph; Breadth-first search; Kruskal's algorithm; Depth-first search; Algorithm; Minimum spanning tree; Mathematics; Theoretical computer science; Discrete mathematics; Search algorithm","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.0003441698,0.0001260673,0.0001492013,0.0001834964,0.0003974981,0.000421547,0.001312325,0.00004897011,0.0000297374],"category_scores_gemma":[0.00006341207,0.0001077952,0.00006917527,0.000185526,0.00006345799,0.0007221589,0.000303606,0.0001231779,0.00003348689],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001207329,"about_ca_system_score_gemma":0.0000120845,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002238306,"about_ca_topic_score_gemma":0.0008637176,"domain_scores_codex":[0.9990146,0.00003790403,0.0001534286,0.0003358405,0.0001341291,0.0003241628],"domain_scores_gemma":[0.9989962,0.00008730369,0.00009103541,0.0007287294,0.00002047603,0.00007624812],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.00006984931,0.0005458382,0.111847,0.00004604199,0.00014983,0.0007922317,0.01340097,0.0008037466,0.005554121,0.6573327,0.002254562,0.2072031],"study_design_scores_gemma":[0.00198583,0.0002158879,0.6186836,0.000274134,0.00001357739,0.00007689204,0.0002021435,0.2431132,0.004233271,0.1262754,0.003890434,0.001035667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6897659,0.0001305079,0.2646527,0.002840555,0.001029704,0.0002617255,0.000003272407,0.0008693059,0.0404463],"genre_scores_gemma":[0.9769381,0.000009302366,0.0223203,0.0001127187,0.0000324421,0.000008393558,8.880572e-7,0.000006061007,0.0005718167],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5310574,"threshold_uncertainty_score":0.4395762,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02790082231256263,"score_gpt":0.2650167553155515,"score_spread":0.2371159330029889,"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."}}