{"id":"W2123784540","doi":"10.1007/3-540-44683-4_11","title":"Refined Search Tree Technique for Dominating Set on Planar Graphs","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Parameterized complexity; Planar graph; Dominating set; Combinatorics; Reduction (mathematics); Search tree; Computer science; Graph; Mathematics; Tree (set theory); Set (abstract data type); Discrete mathematics; Algorithm; Search algorithm; Vertex (graph theory)","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":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.002995943,0.0006943184,0.0006846897,0.002438071,0.0005664746,0.0004529551,0.005702063,0.0004560889,0.00001453709],"category_scores_gemma":[0.0003040557,0.0006285592,0.0002503544,0.001517785,0.001040327,0.0005465619,0.001059281,0.00152257,0.00002684359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004301247,"about_ca_system_score_gemma":0.0004920572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001072828,"about_ca_topic_score_gemma":0.00006043496,"domain_scores_codex":[0.9940423,0.0001026422,0.0006020963,0.002306785,0.001597369,0.001348767],"domain_scores_gemma":[0.9944941,0.002380192,0.0002470564,0.002152292,0.0004483308,0.000278012],"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.00007075143,0.00003948148,0.0000151071,0.00007386987,0.00001487171,0.0001650554,0.0003508096,0.006792026,0.001947627,0.3348157,0.0000588684,0.6556559],"study_design_scores_gemma":[0.0005794136,0.0009504058,0.00002141911,0.0005956457,0.000004725869,0.0001239622,3.83499e-7,0.09597068,0.01598178,0.8824457,0.002466419,0.0008594767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003214303,0.0001206664,0.9881482,0.0009616935,0.0005320889,0.00160958,0.00002454813,0.000230049,0.008341102],"genre_scores_gemma":[0.03025444,0.00006185222,0.9663262,0.001436153,0.0003979139,0.0002175887,0.00002222822,0.0001102911,0.001173295],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6547964,"threshold_uncertainty_score":0.9996775,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03720729722806748,"score_gpt":0.3165555861537211,"score_spread":0.2793482889256537,"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."}}