{"id":"W12912828","doi":"10.1007/978-1-4471-4069-6_5","title":"Graphs and Trees","year":2012,"lang":"en","type":"book-chapter","venue":"Undergraduate topics in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary; Brock University","funders":"","keywords":"Tree traversal; Graph traversal; Floyd–Warshall algorithm; Dijkstra's algorithm; Computer science; Combinatorics; Enhanced Data Rates for GSM Evolution; Mathematics; Breadth-first search; Algorithm; Discrete mathematics; Shortest path problem; Theoretical computer science; Graph; Artificial intelligence","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.0001892296,0.0009502546,0.0006715523,0.001859944,0.00120245,0.002907798,0.000837348,0.0009150116,0.05123511],"category_scores_gemma":[0.0008246287,0.0004247914,0.0003943912,0.003609369,0.00174858,0.004073049,0.001171308,0.002259264,0.01840662],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001535623,"about_ca_system_score_gemma":0.0008151843,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001790514,"about_ca_topic_score_gemma":0.004087274,"domain_scores_codex":[0.9997866,0.00005334666,0.000006797366,0.00004488646,0.00008530928,0.00002312446],"domain_scores_gemma":[0.9997758,0.00009558202,0.00001205547,0.00004028218,0.00004217472,0.00003405184],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007866926,0.00002200923,0.00007446457,0.0002004643,0.000007874478,0.00003484507,0.0004172519,0.0005741557,0.0003070552,0.6458856,0.2546952,0.09777312],"study_design_scores_gemma":[0.000002983123,0.000006151845,0.0001406948,0.0001175811,0.000004691884,0.00006762602,0.0001249424,0.0002937488,0.00008021404,0.3144019,0.6847547,0.000004701236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.002035028,0.0675637,0.01793864,0.0060443,0.004364307,0.00004651858,0.0003133353,0.0003419914,0.9013523],"genre_scores_gemma":[0.03379796,0.05947899,0.01090341,0.00276447,0.004555155,0.0001161355,0.0005991843,0.0005129236,0.8872718],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.05123511,"threshold_uncertainty_score":0.1713985,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03443815039716676,"score_gpt":0.2848112662453842,"score_spread":0.2503731158482174,"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."}}