{"id":"W1568102860","doi":"10.1007/978-3-540-73545-8_37","title":"Linear Algorithm for Broadcasting in Unicyclic Graphs","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Vertex (graph theory); Broadcasting (networking); Graph; Time complexity; Graph algorithms; Algorithm; Upper and lower bounds; Connectivity; Theoretical computer science; Combinatorics; Discrete mathematics; Computer network; Mathematics","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.0006179526,0.0009381925,0.001104246,0.001285181,0.001269626,0.002067447,0.003025111,0.001106362,0.01808552],"category_scores_gemma":[0.003821868,0.0005676424,0.000586729,0.003043651,0.0009868437,0.002881462,0.00281498,0.001860489,0.004523658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002779886,"about_ca_system_score_gemma":0.002384748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005728031,"about_ca_topic_score_gemma":0.007548845,"domain_scores_codex":[0.9989974,0.0001977449,0.00005343953,0.0002088136,0.0002708066,0.0002718279],"domain_scores_gemma":[0.9977821,0.001170668,0.0001333731,0.0004192606,0.000382104,0.0001126514],"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.0009877859,0.0004846135,0.0005150671,0.001151116,0.00009094344,0.0001105473,0.0005196412,0.07480906,0.01092081,0.1318923,0.06554645,0.7129716],"study_design_scores_gemma":[0.0008765024,0.0004215614,0.0006279548,0.0001659163,0.0001418148,0.0003205873,0.0003541821,0.6758322,0.01749671,0.2729448,0.0307268,0.00009104588],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03612116,0.001343649,0.8970336,0.001381076,0.000259001,0.0004130011,0.001173959,0.00733728,0.05493728],"genre_scores_gemma":[0.3043991,0.001402937,0.6338205,0.0008189461,0.0002868426,0.001296648,0.003389437,0.0009809562,0.05360459],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01808552,"threshold_uncertainty_score":0.06050205,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03335498008116616,"score_gpt":0.2787867915580713,"score_spread":0.2454318114769052,"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."}}