{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.006431139,0.000431453,0.0004540375,0.0005878769,0.0008102832,0.0007153961,0.004576282,0.00008494392,0.00001879249],"category_scores_gemma":[0.0003475788,0.0002946996,0.0001339947,0.002814007,0.008238183,0.0008272029,0.001344971,0.0005611336,0.0001007585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008940708,"about_ca_system_score_gemma":0.0001273784,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000234398,"about_ca_topic_score_gemma":0.000004517711,"domain_scores_codex":[0.9942607,0.0001557091,0.0006922663,0.001318317,0.00215549,0.001417537],"domain_scores_gemma":[0.9948223,0.001533684,0.0002243207,0.002294547,0.0004564201,0.0006686974],"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.0001179901,0.0001723548,0.0000170814,0.00002383623,0.0000108079,0.00006436227,0.00106489,0.00005209654,0.0002190023,0.9929848,0.00002905834,0.00524367],"study_design_scores_gemma":[0.0005021701,0.0009561367,0.000357913,0.0001437099,0.000005442449,0.00007182058,0.00005589581,0.1278057,0.006497819,0.8631148,0.00006424906,0.0004242595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02299096,0.00001063933,0.9477398,0.0009867678,0.0001811364,0.0004550629,0.000008461638,0.0004228753,0.02720426],"genre_scores_gemma":[0.5590756,0.000002596575,0.4405286,0.0003153126,0.00003817554,0.000006193249,0.000001677943,0.00001676105,0.0000150558],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5360847,"threshold_uncertainty_score":0.9999505,"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."}}