{"id":"W1988192783","doi":"10.5784/23-1-46","title":"An algorithm for the (r,s)-domination number of a tree","year":2007,"lang":"en","type":"article","venue":"Orion/ORiON","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Neighbourhood (mathematics); Combinatorics; Vertex (graph theory); Mathematics; Graph; Function (biology); Tree (set theory); Domination analysis; Discrete mathematics; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.001433785,0.0009712735,0.001253288,0.001877093,0.001055366,0.001570117,0.002380994,0.001377832,0.006154818],"category_scores_gemma":[0.003876904,0.0005305642,0.001007499,0.001607207,0.0007980832,0.002583459,0.002041423,0.001188255,0.001668083],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002513017,"about_ca_system_score_gemma":0.002815067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003845266,"about_ca_topic_score_gemma":0.005887133,"domain_scores_codex":[0.9992655,0.0001601146,0.00006498735,0.0002085291,0.000140807,0.0001599846],"domain_scores_gemma":[0.9981382,0.0009512213,0.0001743325,0.000297768,0.0002713771,0.000167059],"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.001068562,0.0004687058,0.003751941,0.0006098374,0.0001217652,0.0001939981,0.0007937484,0.1435916,0.02884991,0.05953974,0.02132816,0.7396821],"study_design_scores_gemma":[0.0005098258,0.0003949716,0.00131942,0.00009160783,0.00008635586,0.0004431904,0.0002490777,0.8931609,0.01580307,0.06996092,0.01788254,0.00009812324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07550853,0.0005126372,0.9067006,0.0008644551,0.00008871033,0.0004877408,0.0006921912,0.003928099,0.011217],"genre_scores_gemma":[0.1394011,0.0001681887,0.8527893,0.0001291794,0.00003633359,0.0003206978,0.0008862853,0.0003384033,0.005930537],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006154818,"threshold_uncertainty_score":0.02058989,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02119826534912793,"score_gpt":0.3456694556178839,"score_spread":0.324471190268756,"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."}}