{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003791433,0.0001728393,0.0002830634,0.0002347003,0.0001740474,0.00002488355,0.0007123043,0.00006112675,0.000003186432],"category_scores_gemma":[0.00007423281,0.0001443849,0.0001188361,0.0003981194,0.0001799326,0.00008281031,0.0001407391,0.0001034063,0.00001672385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003096976,"about_ca_system_score_gemma":0.00003521056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.550719e-7,"about_ca_topic_score_gemma":1.938333e-7,"domain_scores_codex":[0.9984629,0.00001636752,0.0003592496,0.0003255642,0.0005176545,0.0003182288],"domain_scores_gemma":[0.998412,0.0005333601,0.00020525,0.0006718936,0.00009885486,0.00007871566],"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.0000177111,0.000183433,0.000001339257,0.0001068486,0.00001717957,0.000001862705,0.001014567,0.001164006,0.006154637,0.9891786,0.00007556218,0.002084257],"study_design_scores_gemma":[0.0007651475,0.0001984875,0.00006039846,0.00003732065,0.000009110482,0.000007781189,0.0001824223,0.1708454,0.05350479,0.7740741,0.00009149715,0.0002235168],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1164491,0.00002785494,0.8793503,0.00007891422,0.00006675171,0.0008303711,0.00001488779,0.0001037702,0.003078046],"genre_scores_gemma":[0.6220733,0.00001186543,0.3775868,0.00003618497,0.00001694473,0.0001697198,0.000006648714,0.00002200545,0.00007660266],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5056242,"threshold_uncertainty_score":0.5887846,"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."}}