{"id":"W2115713772","doi":"10.1016/j.disopt.2008.01.001","title":"A sequential elimination algorithm for computing bounds on the clique number of a graph","year":2008,"lang":"en","type":"article","venue":"Discrete Optimization","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Clique graph; Clique problem; Mathematics; Clique; Block graph; Simplex graph; Upper and lower bounds; Split graph; Branch and bound; Combinatorics; Graph; Computation; Algorithm; Discrete mathematics; Line graph; Graph power; Pathwidth","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":[],"consensus_categories":[],"category_scores_codex":[0.0003229784,0.0001270241,0.0001406443,0.0000928116,0.0004440852,0.00007193668,0.0004426467,0.00005924912,0.00001653445],"category_scores_gemma":[0.00005744183,0.0001015071,0.0001355175,0.000509405,0.0001275155,0.0002735122,0.00009547338,0.0000934137,0.000002491728],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002456526,"about_ca_system_score_gemma":0.00004679623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002208726,"about_ca_topic_score_gemma":0.000001544946,"domain_scores_codex":[0.9989036,0.0000907933,0.0002743238,0.0002718506,0.0002692525,0.0001901185],"domain_scores_gemma":[0.9990168,0.0002178795,0.0001907132,0.0003292191,0.0002108543,0.0000344979],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003186111,0.0002131696,0.0002035859,0.00003468681,0.00008148729,0.000005381215,0.003198231,0.2544032,0.00006478233,0.6738814,0.000853181,0.06702907],"study_design_scores_gemma":[0.0003096027,0.00009023795,0.0002465321,0.00002794316,0.00000729985,0.00001899049,0.00003460756,0.991401,0.0008190744,0.006806163,0.0001128017,0.0001258179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002777471,0.00001094202,0.9948063,0.0006982392,0.0002746339,0.0003451415,0.00001508044,0.00007943479,0.000992767],"genre_scores_gemma":[0.311536,0.00002783201,0.6879593,0.0002280484,0.00009373495,0.00002953513,0.00005399735,0.00001251736,0.00005899628],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7369977,"threshold_uncertainty_score":0.4139341,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03037697177775578,"score_gpt":0.2851965819208649,"score_spread":0.2548196101431092,"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."}}