{"id":"W2021735068","doi":"10.1016/j.dam.2008.03.022","title":"Variable space search for graph coloring","year":2008,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":124,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Complete coloring; Fractional coloring; Vertex (graph theory); Graph coloring; Combinatorics; Best-first search; Edge coloring; List coloring; Space (punctuation); Local search (optimization); Variable neighborhood search; Graph; Set (abstract data type); Search algorithm; Greedy coloring; Beam search; Discrete mathematics; Algorithm; Computer science; Metaheuristic; Graph power; Line graph","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.00238575,0.0001646921,0.0003680015,0.0002268059,0.0006482891,0.0001404642,0.0006051722,0.00009284918,0.0001269793],"category_scores_gemma":[0.0009493764,0.0001268516,0.000143071,0.001001093,0.0001576123,0.000105108,0.0001164944,0.0001535032,0.0003937889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002507717,"about_ca_system_score_gemma":0.0001184848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008701495,"about_ca_topic_score_gemma":0.000001462221,"domain_scores_codex":[0.9976411,0.000019933,0.0005253265,0.0004051259,0.0009282799,0.0004802436],"domain_scores_gemma":[0.9966094,0.00211648,0.0001530093,0.0007259352,0.0002423121,0.0001528631],"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.0000186585,0.00009304906,0.0001039335,0.00002778668,0.00003709651,0.000001548611,0.001743845,0.003117466,0.003218621,0.9874534,0.003940298,0.0002442817],"study_design_scores_gemma":[0.001143947,0.00007641261,0.0001845582,0.00003663242,0.00007994399,0.00003941479,0.004212244,0.04518653,0.01451847,0.9177732,0.01622245,0.0005262081],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07014537,0.00004967924,0.8781286,0.0002967455,0.000181871,0.0005228042,0.0000343588,0.0001378709,0.05050265],"genre_scores_gemma":[0.4043876,0.000008348636,0.5923274,0.00005957505,0.0001031573,0.0001154221,0.000008253447,0.00002741995,0.002962887],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3342422,"threshold_uncertainty_score":0.5172858,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.173262291549744,"score_gpt":0.3769068393962284,"score_spread":0.2036445478464845,"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."}}