{"id":"W2035637517","doi":"10.1016/j.tcs.2007.09.031","title":"On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem","year":2007,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Split graph; Chordal graph; Mathematics; Combinatorics; Clique problem; Treewidth; Cograph; Independent set; Clique graph; Block graph; Perfect graph; Discrete mathematics; Graph; Pathwidth; 1-planar graph; Line graph; Graph power","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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.009802774,0.0003034644,0.0003153639,0.0003702579,0.001043731,0.0008257877,0.003621067,0.00008397918,0.00002050507],"category_scores_gemma":[0.0001566867,0.0001875104,0.00009181525,0.002579253,0.01027515,0.0009340592,0.001694769,0.0006510518,0.00006276813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006802562,"about_ca_system_score_gemma":0.0001506412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007505128,"about_ca_topic_score_gemma":0.000002595622,"domain_scores_codex":[0.995487,0.0003945898,0.0004006786,0.001110463,0.001311124,0.001296166],"domain_scores_gemma":[0.9960079,0.00177455,0.0000963265,0.001348012,0.0002532097,0.0005200608],"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.0001660591,0.00004358225,0.00006345053,0.000006378037,0.000006540928,0.00001992751,0.0006016826,0.00005830562,0.0001515374,0.9824339,0.0001240044,0.01632466],"study_design_scores_gemma":[0.0008282392,0.0003641938,0.0003343406,0.00002508171,0.000003221077,0.0000636304,0.000009835626,0.05618175,0.003087253,0.9383725,0.00047245,0.0002574795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05553988,0.00008252193,0.9333792,0.001498719,0.0003294944,0.0005586692,0.000002773596,0.00023378,0.008374952],"genre_scores_gemma":[0.8997304,0.00001811892,0.09890231,0.001226671,0.00006319673,0.00001611348,6.003047e-7,0.00001468449,0.00002789932],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8441905,"threshold_uncertainty_score":0.9924183,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.00919946598330105,"score_gpt":0.279093221038577,"score_spread":0.269893755055276,"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."}}