{"id":"W2092998591","doi":"10.1016/j.dam.2006.07.017","title":"An adaptive memory algorithm for the k-coloring problem","year":2007,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":105,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval; Polytechnique Montréal","funders":"","keywords":"Graph coloring; Mathematics; Algorithm; Adaptive memory; Edge coloring; Vertex (graph theory); Greedy coloring; Set (abstract data type); Graph; Computer science; Combinatorics; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007286857,0.0001835951,0.0002923771,0.0001408057,0.0006205927,0.0002495441,0.0008976869,0.0000908585,0.00004605902],"category_scores_gemma":[0.0004174281,0.0001073773,0.0001494418,0.0005755151,0.0001524126,0.0001445121,0.00008451159,0.0001770477,0.0001484437],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003319283,"about_ca_system_score_gemma":0.00005646197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008271144,"about_ca_topic_score_gemma":0.00001641603,"domain_scores_codex":[0.9975768,0.00001830674,0.0006624858,0.000397826,0.0008604507,0.000484105],"domain_scores_gemma":[0.9944824,0.003994441,0.0002883657,0.0008627155,0.0002303116,0.0001417759],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005950692,0.0002622429,0.000008882084,0.00001846358,0.0001416941,0.00000261815,0.00723332,0.003644147,0.002063088,0.4911731,0.001217417,0.4941755],"study_design_scores_gemma":[0.0006618134,0.0001394234,0.0001300569,0.00002185906,0.0001509519,0.00001017947,0.02910974,0.4528417,0.005844639,0.5070353,0.003669277,0.000385096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003446878,0.00006911933,0.979894,0.0001554102,0.0001905141,0.0008304022,0.00002473322,0.0001160653,0.01527281],"genre_scores_gemma":[0.24563,0.00000264546,0.7532822,0.0001005908,0.0002419782,0.0001452662,0.000005030582,0.00002865824,0.000563691],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4937904,"threshold_uncertainty_score":0.477316,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1098868155869601,"score_gpt":0.385019381873026,"score_spread":0.275132566286066,"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."}}