{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008106534,0.000636803,0.001353935,0.002019449,0.0006289632,0.00100486,0.002204274,0.0007579521,0.0054162],"category_scores_gemma":[0.003302724,0.0006248843,0.001328154,0.002902173,0.0006752956,0.002952341,0.001748867,0.002083202,0.001164462],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008122684,"about_ca_system_score_gemma":0.0007524047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00153,"about_ca_topic_score_gemma":0.002185008,"domain_scores_codex":[0.9992167,0.00017534,0.00004595946,0.0001388153,0.0003535518,0.00006965903],"domain_scores_gemma":[0.9985272,0.0007387519,0.00005667562,0.0003915996,0.0002340202,0.00005174898],"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.0005244758,0.000231848,0.0006398643,0.00123991,0.000177729,0.0002530151,0.0006812164,0.1023911,0.06145048,0.3751921,0.01846188,0.4387563],"study_design_scores_gemma":[0.0001547483,0.000303036,0.000865236,0.0001138965,0.0002253332,0.0006093763,0.0001543443,0.6169104,0.02270334,0.3267517,0.03114211,0.00006657127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01772481,0.000900698,0.9743575,0.0002138697,0.00009461193,0.0001316878,0.0003031262,0.0005907277,0.005682972],"genre_scores_gemma":[0.1465166,0.00140995,0.8389411,0.0001662674,0.0001407338,0.0002380283,0.001014416,0.0003773575,0.01119556],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0054162,"threshold_uncertainty_score":0.01811904,"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."}}