{"id":"W3082111916","doi":"10.1007/s10878-020-00630-z","title":"Incremental optimization of independent sets under the reconfiguration framework","year":2020,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science; Core Research for Evolutional Science and Technology; Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Mathematics; Combinatorics; Treewidth; Chordal graph; Pathwidth; Independent set; Vertex cover; Maximal independent set; Discrete mathematics; Bounded function; Degeneracy (biology); Vertex (graph theory); Dominating set; Planar graph; Clique-sum; Upper and lower bounds; Time complexity; Graph; 1-planar 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008295969,0.0001183025,0.000226103,0.0001345571,0.0001255011,0.0001246126,0.0008251876,0.000108106,0.00006220971],"category_scores_gemma":[0.0004671361,0.00009086356,0.0001009597,0.0008012728,0.00006198536,0.001132386,0.0001262868,0.0003760377,0.000002061717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008550086,"about_ca_system_score_gemma":0.0001714031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001553091,"about_ca_topic_score_gemma":7.014611e-8,"domain_scores_codex":[0.9978713,0.0003474219,0.0006513649,0.0001562203,0.0008220077,0.0001516201],"domain_scores_gemma":[0.9977806,0.0002746039,0.0008505928,0.0002351801,0.0007446835,0.0001143661],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001250805,0.00005744571,0.000046728,0.000007444853,0.00003284421,0.000002262989,0.0004646647,0.8675405,0.0002956263,0.130736,0.00008908878,0.0006023043],"study_design_scores_gemma":[0.001491083,0.0007642923,0.0001127759,0.0000592449,0.00002564974,0.0000224289,0.0002743782,0.9198388,0.005813179,0.0713811,0.00006670712,0.0001504006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002513999,0.00008028384,0.9921265,0.003433327,0.0014086,0.0002110899,0.000001293618,0.00001997932,0.0002049117],"genre_scores_gemma":[0.7668264,0.00009026148,0.2325869,0.0002515413,0.000224175,0.00000249533,0.000003088071,0.00001271499,0.000002428055],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7643124,"threshold_uncertainty_score":0.3705308,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02336265583839775,"score_gpt":0.288456861819923,"score_spread":0.2650942059815253,"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."}}