{"id":"W2075240586","doi":"10.1002/net.21505","title":"Optimal edge‐coloring with edge rate constraints","year":2013,"lang":"en","type":"article","venue":"Networks","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University; Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorics; Time complexity; Mathematics; Discrete mathematics; Indifference graph; Pooling; Sequence (biology); Matching (statistics); Chordal graph; Pathwidth; Computer science; Graph; Line graph","routes":{"ca_aff":true,"ca_fund":true,"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.0009951148,0.001356996,0.001443042,0.0004760043,0.0006827784,0.001263563,0.001758464,0.001254395,0.005026551],"category_scores_gemma":[0.003582748,0.0005532048,0.0006812107,0.001426194,0.0007779588,0.002456168,0.0009373673,0.001237509,0.0007584181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001527558,"about_ca_system_score_gemma":0.001391563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003763164,"about_ca_topic_score_gemma":0.004544936,"domain_scores_codex":[0.9991013,0.0002523882,0.00002925473,0.0002499181,0.0001111609,0.0002560193],"domain_scores_gemma":[0.9983961,0.0009026932,0.000163816,0.0002603462,0.0001032797,0.0001738177],"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.0004425199,0.0002146973,0.001136177,0.0003033656,0.00006427561,0.0002115781,0.0001059791,0.8738826,0.007641043,0.05925254,0.007334125,0.04941114],"study_design_scores_gemma":[0.00007429695,0.0001083778,0.000342313,0.00001464418,0.00002771058,0.0001005725,0.00006359811,0.9116504,0.00244925,0.08215043,0.002999077,0.00001931863],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2445423,0.001019015,0.7322243,0.001129604,0.0002416477,0.0002386032,0.001322775,0.0009880338,0.01829373],"genre_scores_gemma":[0.7373891,0.0008051082,0.249925,0.0003771496,0.0001364909,0.0001736077,0.0009923331,0.0003450169,0.009856299],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005026551,"threshold_uncertainty_score":0.01681548,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01747177441735967,"score_gpt":0.2579535936966993,"score_spread":0.2404818192793397,"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."}}