{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006386732,0.0009331915,0.001001115,0.001875447,0.001206901,0.0008748806,0.0009981118,0.0008435216,0.002828909],"category_scores_gemma":[0.002990412,0.0005867634,0.0009371748,0.001623723,0.0004030437,0.002314973,0.001030242,0.0006147414,0.0008169121],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004235782,"about_ca_system_score_gemma":0.001287672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001643888,"about_ca_topic_score_gemma":0.00338538,"domain_scores_codex":[0.9994169,0.0001552944,0.0000586603,0.00016181,0.0001286124,0.00007868233],"domain_scores_gemma":[0.9990441,0.0005160701,0.0001097789,0.0001260232,0.0001351196,0.00006883041],"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.0002511878,0.0002967256,0.004054739,0.001450703,0.0001907835,0.0007064685,0.0006902337,0.1914664,0.02996987,0.04397937,0.008989322,0.7179542],"study_design_scores_gemma":[0.0001126244,0.0004363209,0.001995107,0.0001538841,0.0001803439,0.001835863,0.0007017366,0.7393335,0.02601762,0.2064018,0.0227486,0.00008271293],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0507546,0.0006659002,0.9435536,0.0002156368,0.00003939799,0.0002565499,0.0005702004,0.001176601,0.002767565],"genre_scores_gemma":[0.1446122,0.0004586426,0.8515928,0.00009284822,0.00001871425,0.0001214023,0.001472444,0.0001680661,0.001462886],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002828909,"threshold_uncertainty_score":0.009463608,"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."}}