{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00106847,0.001446747,0.001377216,0.0009235141,0.001615867,0.003036795,0.002909853,0.001501656,0.01127292],"category_scores_gemma":[0.003572269,0.001024545,0.001671623,0.002356805,0.001168016,0.004700475,0.003422499,0.0025035,0.002662237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002599193,"about_ca_system_score_gemma":0.003801728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005427211,"about_ca_topic_score_gemma":0.01233681,"domain_scores_codex":[0.9986923,0.0002280866,0.00009039277,0.0004079648,0.0002488137,0.0003324535],"domain_scores_gemma":[0.9964851,0.001575248,0.0002200437,0.000919188,0.0003920907,0.0004083196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002428243,0.001045692,0.003132313,0.001397648,0.0002604038,0.0003219781,0.0008585852,0.1047644,0.04326745,0.103704,0.04776524,0.691054],"study_design_scores_gemma":[0.001061887,0.0004494047,0.002194315,0.0001006251,0.0003134318,0.00047228,0.0006662083,0.6361545,0.02112776,0.316709,0.02063238,0.0001182594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1132826,0.0004489181,0.8580099,0.001651451,0.0002379023,0.0005245486,0.001477588,0.007961752,0.01640529],"genre_scores_gemma":[0.2756534,0.0002562759,0.7105302,0.0003531083,0.00009687319,0.0003348261,0.003081974,0.0008988484,0.008794513],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01127292,"threshold_uncertainty_score":0.03771162,"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."}}