{"id":"W1502166895","doi":"10.46298/dmtcs.387","title":"Complexity results on graphs with few cliques","year":2007,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Mathematics; Chordal graph; Split graph; Discrete mathematics; Clique graph; Vertex cover; Clique-sum; Indifference graph; Cograph; Vertex (graph theory); Clique problem; Block graph; Time complexity; Treewidth; Pathwidth; Graph; 1-planar graph; Line graph; Graph power","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.00196497,0.001427969,0.00183868,0.002776378,0.001996777,0.004920993,0.002838338,0.001805972,0.01226123],"category_scores_gemma":[0.01548773,0.0009060554,0.002106688,0.004319302,0.003365773,0.01144316,0.003206899,0.004568535,0.001117836],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004281332,"about_ca_system_score_gemma":0.001588178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004427579,"about_ca_topic_score_gemma":0.004026035,"domain_scores_codex":[0.9961817,0.0008807333,0.000169558,0.0009299502,0.001206725,0.0006312281],"domain_scores_gemma":[0.9607934,0.03177384,0.001701388,0.00346099,0.001171375,0.001099034],"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.0006198401,0.0004908707,0.00566614,0.001449674,0.0003051058,0.0003403838,0.0008994428,0.1752704,0.005424528,0.7130973,0.033927,0.06250943],"study_design_scores_gemma":[0.00007168805,0.00003889539,0.001812647,0.00005337961,0.00006723899,0.0002317723,0.000132565,0.1470051,0.0008671852,0.841723,0.007967737,0.00002876332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2884974,0.01569984,0.5503227,0.01962795,0.0005275749,0.000461565,0.00560249,0.001746694,0.1175138],"genre_scores_gemma":[0.8385013,0.007654346,0.1222677,0.001895971,0.002088385,0.0005555492,0.005973315,0.0007982327,0.02026516],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01226123,"threshold_uncertainty_score":0.04101795,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03449243138924327,"score_gpt":0.3270042868670117,"score_spread":0.2925118554777685,"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."}}