{"id":"W2083057776","doi":"10.1016/j.dam.2004.03.001","title":"A polynomial time algorithm for strong edge coloring of partial k-trees","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Time complexity; Combinatorics; Enhanced Data Rates for GSM Evolution; Algorithm; Edge coloring; Polynomial; Discrete mathematics; Computer science; Artificial intelligence; 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.0003720706,0.0001813971,0.0003332454,0.0001085171,0.0001179796,0.00006191422,0.0008459535,0.00006649527,0.000006875983],"category_scores_gemma":[0.00004005782,0.0001639699,0.0001158591,0.000271616,0.0001454599,0.0001938298,0.0003090372,0.0001144667,0.00004541905],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005331078,"about_ca_system_score_gemma":0.00008751987,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001737161,"about_ca_topic_score_gemma":9.6151e-7,"domain_scores_codex":[0.9985113,0.00001009815,0.0003832442,0.0003157565,0.0003333064,0.0004462643],"domain_scores_gemma":[0.9988286,0.0002350513,0.0001809203,0.0005829697,0.00006440022,0.0001080182],"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.0000369555,0.0002284888,0.000002073543,0.0001414017,0.00008092541,0.000003875153,0.00214518,0.001456008,0.04105577,0.9230317,0.0001306318,0.031687],"study_design_scores_gemma":[0.004120839,0.0004799438,0.00002309093,0.0001357149,0.00005722303,0.00001457626,0.0006488248,0.2785828,0.3422137,0.3719303,0.001006599,0.0007863742],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009031251,0.00002017264,0.9881418,0.00006132313,0.00006020797,0.00069817,0.00003047763,0.0001096007,0.001847042],"genre_scores_gemma":[0.1595261,0.000002562979,0.8400511,0.00001359991,0.00009003978,0.0001841127,0.000009347683,0.00002903178,0.00009413333],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5511014,"threshold_uncertainty_score":0.66865,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02172642579225393,"score_gpt":0.2884099129451471,"score_spread":0.2666834871528931,"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."}}