{"id":"W113325530","doi":"10.1007/3-540-45995-2_22","title":"On the Power of BFS to Determine a Graphs Diameter","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Lexicographical order; Upper and lower bounds; Combinatorics; Computer science; Graph; Constant (computer programming); Expressive power; Discrete mathematics; Algorithm; Mathematics; Theoretical computer science; Programming language","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.004004416,0.001498667,0.002358265,0.004448333,0.001865461,0.003364808,0.003357115,0.002161294,0.008291951],"category_scores_gemma":[0.03075927,0.00115488,0.001511086,0.004163219,0.003792497,0.01083404,0.003257129,0.004482602,0.002759198],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002166608,"about_ca_system_score_gemma":0.001299916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005265311,"about_ca_topic_score_gemma":0.004841146,"domain_scores_codex":[0.9966384,0.001205109,0.000144151,0.0006572536,0.00102166,0.0003334004],"domain_scores_gemma":[0.9686999,0.02574834,0.0006285795,0.002533433,0.001635574,0.0007541716],"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.001207358,0.0003034636,0.009542647,0.0006764462,0.0001451619,0.0003063208,0.001093033,0.0980484,0.01072344,0.5280531,0.03064975,0.3192509],"study_design_scores_gemma":[0.00006237261,0.00008183024,0.001309945,0.0000960336,0.00005970761,0.0002225567,0.0001614269,0.2415187,0.003745347,0.745663,0.00703269,0.00004627736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1190894,0.003437611,0.8157728,0.003589855,0.000430979,0.0001237256,0.0009697509,0.002403569,0.05418235],"genre_scores_gemma":[0.5598668,0.002186252,0.4197095,0.0009183652,0.001163385,0.0002289538,0.001443509,0.001224866,0.01325844],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008291951,"threshold_uncertainty_score":0.02773935,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02795340454505029,"score_gpt":0.271347188716214,"score_spread":0.2433937841711637,"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."}}