{"id":"W2790020036","doi":"10.1007/978-3-319-94776-1_36","title":"Reconfiguring Spanning and Induced Subgraphs","year":2018,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Japan Science and Technology Agency; Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Control reconfiguration; Reachability; Induced subgraph isomorphism problem; Combinatorics; Subgraph isomorphism problem; Matching (statistics); Graph factorization; Independent set; Graph; Mathematics; Induced subgraph; Clique; Computer science; Split graph; Distance-hereditary graph; Theoretical computer science; Discrete mathematics; Line graph; Graph power; Vertex (graph theory); Pathwidth; Voltage 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.000273889,0.000452018,0.0004281387,0.000619665,0.0004730834,0.0006945606,0.001115202,0.0005790143,0.005481208],"category_scores_gemma":[0.0028525,0.0003603782,0.0004636103,0.0006143732,0.0004873551,0.001706357,0.001288343,0.0006507247,0.0009223023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002836545,"about_ca_system_score_gemma":0.0002937722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000554329,"about_ca_topic_score_gemma":0.001305546,"domain_scores_codex":[0.999653,0.00007674134,0.00002030836,0.0001099278,0.00005836531,0.00008164019],"domain_scores_gemma":[0.9976416,0.0006939932,0.0001646798,0.001048929,0.0001833689,0.0002674103],"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.001343739,0.0004664043,0.005640273,0.000517873,0.0001649117,0.001402571,0.0008960609,0.20089,0.1915692,0.1165958,0.01259606,0.4679171],"study_design_scores_gemma":[0.0001157973,0.000348532,0.003224822,0.00006382681,0.0001570405,0.00121662,0.0007278155,0.6852918,0.06287313,0.2281162,0.01781523,0.00004926762],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6244789,0.0002898932,0.3445611,0.0004923276,0.0002127573,0.0001249076,0.0003879306,0.003531153,0.02592103],"genre_scores_gemma":[0.8897058,0.0001584649,0.1039539,0.0001526704,0.00004572393,0.00005339809,0.0004546159,0.0005219111,0.004953436],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005481208,"threshold_uncertainty_score":0.01833647,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03660469968966788,"score_gpt":0.3142294430628079,"score_spread":0.27762474337314,"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."}}