{"id":"W1990809933","doi":"10.1016/s0166-218x(01)00237-2","title":"On the computational complexity of strong edge coloring","year":2002,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"University of Toronto","keywords":"Mathematics; Edge coloring; Combinatorics; Computational complexity theory; Graph coloring; Time complexity; Graph; Completeness (order theory); Matching (statistics); Enhanced Data Rates for GSM Evolution; Discrete mathematics; Algorithm; Graph power; Artificial intelligence; Computer science; Line graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004799743,0.001492125,0.002425954,0.001755489,0.002487735,0.006894726,0.005058436,0.002675439,0.01610107],"category_scores_gemma":[0.04312851,0.001240517,0.0022061,0.004254775,0.005432377,0.0194032,0.00554033,0.006588842,0.00141976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004988171,"about_ca_system_score_gemma":0.004425243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0051674,"about_ca_topic_score_gemma":0.005920819,"domain_scores_codex":[0.9940045,0.002463973,0.0002407181,0.0008700631,0.00129964,0.001121118],"domain_scores_gemma":[0.9075149,0.08032705,0.002403481,0.00593934,0.002086402,0.001728798],"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.002543421,0.000509357,0.004370334,0.0006344584,0.0001848241,0.0002503495,0.0007517964,0.1903074,0.003603813,0.711483,0.02897319,0.05638813],"study_design_scores_gemma":[0.0001660314,0.00005433579,0.0007146496,0.00003568482,0.0000647072,0.00009102216,0.0001615199,0.2266714,0.0008609565,0.7691834,0.00196489,0.00003133506],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5174775,0.003483119,0.3521293,0.03029518,0.0009650584,0.0003636385,0.00428053,0.001591308,0.08941438],"genre_scores_gemma":[0.9149032,0.00194359,0.06451152,0.001661184,0.001218353,0.0003586603,0.002143768,0.000643174,0.0126166],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01610107,"threshold_uncertainty_score":0.05386341,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09358971132498799,"score_gpt":0.3031898687250434,"score_spread":0.2096001574000554,"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."}}