{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001118263,0.00129429,0.001586055,0.0008816847,0.0005108404,0.001466184,0.002505383,0.00120742,0.008269575],"category_scores_gemma":[0.004310058,0.0006572169,0.001168082,0.001441049,0.0008564134,0.002313204,0.001706265,0.002045177,0.000841151],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001065903,"about_ca_system_score_gemma":0.001207468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001607294,"about_ca_topic_score_gemma":0.001978265,"domain_scores_codex":[0.9993153,0.0002578227,0.00001817969,0.0001214486,0.0001519356,0.0001353727],"domain_scores_gemma":[0.9981609,0.001245582,0.0001111846,0.0002053918,0.0001453808,0.0001316172],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002076863,0.0001725269,0.0003521852,0.0001994635,0.00007607532,0.0001549108,0.00005647806,0.7798539,0.002192566,0.128911,0.007294738,0.08052855],"study_design_scores_gemma":[0.00002664307,0.00005514069,0.0001559886,0.00001192482,0.00002179201,0.0000378561,0.0000183251,0.9108738,0.0006478744,0.08689417,0.001246464,0.000009965059],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06224467,0.0004871802,0.9082784,0.000630765,0.0001328185,0.0001427899,0.0003632916,0.000633103,0.02708701],"genre_scores_gemma":[0.7278373,0.0006923285,0.2559481,0.0002595789,0.0002382641,0.0003548401,0.0008676906,0.0004669072,0.01333496],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008269575,"threshold_uncertainty_score":0.02766448,"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."}}