{"id":"W2013474931","doi":"10.1016/j.dam.2008.01.011","title":"Efficient algorithms for Roman domination on some classes of graphs","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Vertex (graph theory); Interval graph; Domination analysis; Graph; Time complexity; Minimum weight; Chordal graph; Discrete mathematics; 1-planar graph","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.001885286,0.001341062,0.001799605,0.002005762,0.002903522,0.00444733,0.003864962,0.001987881,0.01792932],"category_scores_gemma":[0.009383907,0.001149642,0.002378761,0.002829656,0.002115153,0.008684833,0.004548259,0.003886957,0.002229047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003274945,"about_ca_system_score_gemma":0.00231747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002731384,"about_ca_topic_score_gemma":0.006987081,"domain_scores_codex":[0.9976278,0.0006503209,0.0001148315,0.0005662228,0.0004603425,0.0005804902],"domain_scores_gemma":[0.9922872,0.005002394,0.000460139,0.001380509,0.000401579,0.0004682574],"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.001271375,0.0008181283,0.00416068,0.0008471783,0.0002126072,0.0002627187,0.00172975,0.07020473,0.01015985,0.575121,0.0383324,0.2968796],"study_design_scores_gemma":[0.0003616171,0.00008444775,0.000793233,0.00006456059,0.0001079862,0.0002455615,0.0003914672,0.2587507,0.004384482,0.7234728,0.01129903,0.00004415276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3819215,0.001221163,0.5233786,0.004804255,0.0002231135,0.0008260937,0.001756647,0.003343209,0.08252535],"genre_scores_gemma":[0.6327989,0.000808168,0.3287475,0.0007683664,0.0002511514,0.0005417937,0.003217842,0.001207468,0.03165882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01792932,"threshold_uncertainty_score":0.05997956,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03393014591615173,"score_gpt":0.3040478813041502,"score_spread":0.2701177353879985,"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."}}