{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005213065,0.0005834684,0.0008220902,0.0006613677,0.0006259189,0.0008860995,0.002463735,0.00100064,0.004951779],"category_scores_gemma":[0.00256195,0.0003720937,0.0005517724,0.001241606,0.0005129681,0.001547623,0.001430134,0.00117281,0.0006015529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009134959,"about_ca_system_score_gemma":0.001550591,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005527361,"about_ca_topic_score_gemma":0.00690986,"domain_scores_codex":[0.9996735,0.00006722712,0.00001732879,0.00008715854,0.000067384,0.00008747498],"domain_scores_gemma":[0.9991713,0.0004277503,0.00007567977,0.0001447139,0.0001174517,0.00006324716],"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.00107109,0.0003685692,0.001143927,0.0002731674,0.00009554142,0.00007830594,0.0001741296,0.3500439,0.01063248,0.04422065,0.01048145,0.5814168],"study_design_scores_gemma":[0.0001614678,0.00009743018,0.0001880552,0.00001373933,0.00002858384,0.0000424977,0.00002785813,0.9702917,0.002241042,0.02517704,0.001716802,0.00001382135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06196149,0.0004891545,0.9290357,0.0003892152,0.0001465402,0.0001204736,0.0001457294,0.001451501,0.006260187],"genre_scores_gemma":[0.4481229,0.0003151287,0.5443547,0.0002443479,0.00008571573,0.0002909248,0.000344502,0.0002008229,0.006040819],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005527361,"threshold_uncertainty_score":0.01656532,"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."}}