{"id":"W2075457919","doi":"10.1016/j.jcss.2004.03.007","title":"A refined search tree technique for Dominating Set on planar graphs","year":2004,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria; University of Lethbridge","funders":"","keywords":"Combinatorics; Mathematics; Dominating set; Parameterized complexity; Vertex (graph theory); Independent set; Feedback vertex set; Planar graph; Discrete mathematics; Maximal independent set; Vertex cover; Time complexity; Chordal graph; Undirected graph; Graph; 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.00402237,0.0001280274,0.0002929351,0.0006277293,0.0004078658,0.0002969909,0.001201401,0.00004520323,2.770551e-7],"category_scores_gemma":[0.0000315761,0.00008648109,0.0001134705,0.0007019822,0.0002001695,0.0005883485,0.000106703,0.0001894555,0.000001113659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006313835,"about_ca_system_score_gemma":0.0001667277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003851062,"about_ca_topic_score_gemma":0.000001991597,"domain_scores_codex":[0.9980868,0.0001616001,0.0004295649,0.0002868802,0.0007006604,0.0003345255],"domain_scores_gemma":[0.9986838,0.0004850368,0.0002356038,0.0001994509,0.0002450713,0.0001510396],"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.00009803737,0.00006767442,0.0002286163,0.0001719983,0.00003192181,0.00010803,0.001336616,0.003730685,0.004504334,0.951125,0.0001925254,0.0384046],"study_design_scores_gemma":[0.01306612,0.0345981,0.005185315,0.006907771,0.00004687377,0.01319356,0.003865614,0.1693412,0.07959145,0.6706198,0.001669931,0.001914186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03814575,0.0001250505,0.9599119,0.0007387158,0.0002730717,0.0002857537,0.000002129826,0.00002785126,0.0004897452],"genre_scores_gemma":[0.7251117,0.000006473286,0.2746974,0.00006607384,0.00009642111,0.000008645407,9.899759e-8,0.000004109925,0.000009084233],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6869659,"threshold_uncertainty_score":0.3526596,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04379541596315799,"score_gpt":0.331260597960581,"score_spread":0.287465181997423,"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."}}