{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001438924,0.001007004,0.001716409,0.001698967,0.002859381,0.004084984,0.003015822,0.003380998,0.01078115],"category_scores_gemma":[0.01257384,0.0008710045,0.0009044687,0.005008298,0.003113117,0.00955731,0.003349432,0.003544601,0.0009219029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001999529,"about_ca_system_score_gemma":0.00121602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002554165,"about_ca_topic_score_gemma":0.003014269,"domain_scores_codex":[0.9987736,0.0004165928,0.00003891392,0.0002754978,0.0003005772,0.0001947124],"domain_scores_gemma":[0.9900382,0.007398937,0.0009028882,0.0005869502,0.0003802667,0.0006928827],"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.0003642424,0.000194381,0.001082585,0.0003044404,0.00006933395,0.0001626272,0.0005209263,0.0476668,0.001469166,0.9023582,0.01543125,0.03037605],"study_design_scores_gemma":[0.00005821465,0.00002152765,0.0002496376,0.00002168752,0.00001589695,0.00006895138,0.000150075,0.04870782,0.0002526391,0.9476858,0.00275524,0.00001238781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4376123,0.004400612,0.4323953,0.01545668,0.0004683647,0.0003203499,0.002112973,0.0005203362,0.1067131],"genre_scores_gemma":[0.8706415,0.003959969,0.09226841,0.001098891,0.001134057,0.0003498867,0.002579001,0.0002908724,0.02767737],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01078115,"threshold_uncertainty_score":0.03606653,"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."}}