{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00218727,0.00165058,0.001743066,0.002497279,0.00123261,0.001857671,0.003169462,0.001278773,0.007947572],"category_scores_gemma":[0.00773118,0.0009776964,0.001465846,0.003447504,0.001347337,0.003523253,0.002424126,0.002767951,0.001521866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001814269,"about_ca_system_score_gemma":0.003545129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006306775,"about_ca_topic_score_gemma":0.01223103,"domain_scores_codex":[0.9982787,0.0003619277,0.0000952099,0.0004024166,0.0006429474,0.0002186963],"domain_scores_gemma":[0.9930395,0.00427371,0.0002820966,0.001218628,0.000911547,0.0002744831],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001426456,0.0007176199,0.002401397,0.0004701029,0.0002518146,0.0001283801,0.0002475198,0.2692248,0.01639895,0.09464179,0.01855613,0.595535],"study_design_scores_gemma":[0.0001917317,0.0001357492,0.0006076219,0.00002143481,0.00006074715,0.00008984271,0.00003465579,0.9136518,0.004847679,0.07621738,0.004113903,0.00002743253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01209792,0.0001496669,0.9830525,0.000201164,0.00005907172,0.0001344377,0.0002353913,0.0008875181,0.003182351],"genre_scores_gemma":[0.1315447,0.0001857457,0.8613989,0.0001629112,0.0001314088,0.0004232283,0.001270113,0.0004061227,0.004476874],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007947572,"threshold_uncertainty_score":0.02658725,"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."}}