{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001577278,0.0007934795,0.001762103,0.002766069,0.0008088821,0.001233447,0.002838049,0.001166033,0.004535197],"category_scores_gemma":[0.007490596,0.0008685879,0.001918068,0.003563736,0.0008490365,0.003787245,0.002471195,0.002199086,0.001116428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009042701,"about_ca_system_score_gemma":0.001129983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002546777,"about_ca_topic_score_gemma":0.004051043,"domain_scores_codex":[0.9985253,0.0003797143,0.0001008495,0.0002561859,0.0006010861,0.0001368792],"domain_scores_gemma":[0.9965093,0.001778695,0.0001527722,0.0009012489,0.0005447516,0.0001131865],"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.0007451332,0.0003863772,0.00157398,0.001229277,0.0002987806,0.0003103563,0.0009449994,0.2135952,0.06543542,0.1822477,0.01464757,0.5185853],"study_design_scores_gemma":[0.000146146,0.0003180331,0.0008233048,0.00008986198,0.0002238962,0.0003965127,0.0001417497,0.8648952,0.01273104,0.1060073,0.01416667,0.0000602154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01713439,0.0005546559,0.9787375,0.0001971446,0.00006911402,0.0001739707,0.000238484,0.0005711879,0.002323674],"genre_scores_gemma":[0.1090377,0.0005955882,0.8844939,0.0001587,0.00009680997,0.000197508,0.0007435434,0.0002992372,0.004376913],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004535197,"threshold_uncertainty_score":0.01517177,"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."}}