{"id":"W3036487380","doi":"10.1145/3470869","title":"On the Parameterized Approximability of Contraction to Classes of Chordal Graphs","year":2021,"lang":"en","type":"preprint","venue":"ACM Transactions on Computation Theory","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Department of Science and Technology, Ministry of Science and Technology, India; European Commission","keywords":"Parameterized complexity; Combinatorics; Chordal graph; Mathematics; Bounded function; Contraction (grammar); Treewidth; Time complexity; Discrete mathematics; Graph; Pathwidth; Line graph; Mathematical analysis","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.002464307,0.00130126,0.001739095,0.001082889,0.001487967,0.003663717,0.003806175,0.001810205,0.005187879],"category_scores_gemma":[0.02443354,0.0007561024,0.002467083,0.001813237,0.00279291,0.01149074,0.003811819,0.00487847,0.0006157503],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004322968,"about_ca_system_score_gemma":0.002387714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00579484,"about_ca_topic_score_gemma":0.004619527,"domain_scores_codex":[0.9965643,0.0006129476,0.0001958334,0.001137281,0.000718543,0.000771179],"domain_scores_gemma":[0.9783722,0.01441367,0.001442819,0.004049966,0.0007033457,0.001017905],"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.002680547,0.001044149,0.01937293,0.0008071503,0.0003134617,0.0004333276,0.002964597,0.5326599,0.02065299,0.2876721,0.01062458,0.1207742],"study_design_scores_gemma":[0.0001271923,0.000157788,0.001365553,0.00003567612,0.00007902964,0.0002269466,0.0002661839,0.789736,0.004152446,0.2016836,0.002134467,0.0000351461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6270781,0.0007939541,0.356954,0.002579718,0.00008054483,0.0002175974,0.0008836684,0.0022546,0.009157738],"genre_scores_gemma":[0.9098533,0.0005743466,0.08268131,0.0003867901,0.000162671,0.0002222198,0.001565924,0.0005569702,0.00399651],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00579484,"threshold_uncertainty_score":0.03136539,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0400114360570754,"score_gpt":0.3237282170312386,"score_spread":0.2837167809741632,"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."}}