{"id":"W2141410486","doi":"10.1007/s10878-006-9019-3","title":"On edge orienting methods for graph coloring","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Optimization","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Digraph; Graph coloring; Edge coloring; Tabu search; Theory of computation; Fractional coloring; Mathematics; Graph; Combinatorics; Computer science; Theoretical computer science; Discrete mathematics; Algorithm; 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":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.007548969,0.0001096711,0.0003270562,0.000575002,0.0003196476,0.0002872364,0.0003559231,0.00009644851,0.00003728111],"category_scores_gemma":[0.01093869,0.00008581145,0.0002646175,0.00101734,0.00003632853,0.0003830212,0.00002541549,0.0001713646,0.000005257637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006737349,"about_ca_system_score_gemma":0.0001255667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004912521,"about_ca_topic_score_gemma":1.649978e-7,"domain_scores_codex":[0.9976034,0.0002922441,0.001013878,0.0001809198,0.0006975906,0.0002119493],"domain_scores_gemma":[0.9935426,0.003369975,0.001058969,0.0001963667,0.001753582,0.00007854946],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001403442,0.0001389696,0.0001922067,0.000001730685,0.00001798418,8.227966e-7,0.00004070804,0.8464494,0.0001702317,0.1480393,0.002546395,0.002261906],"study_design_scores_gemma":[0.002891366,0.0005374356,0.0001932017,0.00004610321,0.00008844941,0.00001353114,0.0000816739,0.2197305,0.00275106,0.7626322,0.01085231,0.0001822084],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01076601,0.0001092219,0.9749966,0.0003044337,0.01236371,0.0001306188,0.000001879883,0.00001941649,0.001308056],"genre_scores_gemma":[0.2650865,0.000005536499,0.7334011,0.00003368459,0.001213523,0.000004937645,0.000003065169,0.00001576392,0.0002358985],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6267189,"threshold_uncertainty_score":0.9973926,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07129417282979277,"score_gpt":0.4222655733320862,"score_spread":0.3509714005022934,"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."}}