{"id":"W1484691446","doi":"10.1016/j.tcs.2016.08.016","title":"The complexity of dominating set reconfiguration","year":2016,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Dominating set; Mathematics; Discrete mathematics; Bipartite graph; Vertex (graph theory); Bounded function; Time complexity; Sequence (biology); Existential quantification; Maximal independent set; Split graph; Pathwidth; Graph; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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.003209954,0.0009397984,0.002387399,0.00158994,0.002130278,0.008031608,0.003667292,0.002871203,0.01121301],"category_scores_gemma":[0.03262896,0.001270671,0.001884157,0.003476112,0.003358086,0.01364024,0.003994332,0.004055801,0.0009141838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005067203,"about_ca_system_score_gemma":0.00281415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002463562,"about_ca_topic_score_gemma":0.002362896,"domain_scores_codex":[0.9942846,0.001929393,0.0003131137,0.001030433,0.001462009,0.0009803731],"domain_scores_gemma":[0.9545282,0.03545572,0.002670554,0.004121344,0.001305042,0.001919131],"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.001587956,0.0003373977,0.005013144,0.0008463711,0.0002481355,0.0005163668,0.0008695406,0.3568689,0.005950443,0.5313458,0.02225473,0.07416118],"study_design_scores_gemma":[0.0001517392,0.00008455097,0.001165823,0.00003955982,0.00009695713,0.0003581508,0.0002562426,0.3119733,0.00127,0.6809483,0.003612763,0.00004262756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6405066,0.004101727,0.2478781,0.01917026,0.0007042566,0.0003781202,0.00400861,0.001319533,0.08193284],"genre_scores_gemma":[0.9652652,0.001361733,0.02323117,0.0005498246,0.0005055264,0.0001806399,0.001327486,0.0002927077,0.007285852],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01121301,"threshold_uncertainty_score":0.03751123,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04426428454903826,"score_gpt":0.3193597798728391,"score_spread":0.2750954953238009,"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."}}