{"id":"W4385963754","doi":"10.46298/theoretics.23.9","title":"Brooks' Theorem in Graph Streams: A Single-Pass Semi-Streaming Algorithm for $\\Delta$-Coloring","year":2023,"lang":"en","type":"article","venue":"TheoretiCS","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"European Commission; National Science Foundation","keywords":"Greedy coloring; Graph coloring; Fractional coloring; Edge coloring; Colored; Impossibility; Combinatorics; Complete coloring; Graph; Computer science; Streaming algorithm; Mathematics; Discrete mathematics; Algorithm; Theoretical computer science; Graph power; Line graph; Upper and lower bounds","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.004964494,0.001557764,0.001392147,0.0009898777,0.001761324,0.00217818,0.004772368,0.001791,0.00523481],"category_scores_gemma":[0.02234915,0.0009723415,0.001760597,0.001219738,0.003133894,0.006268806,0.003476858,0.003815714,0.001630751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003347293,"about_ca_system_score_gemma":0.005602761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00728718,"about_ca_topic_score_gemma":0.008662761,"domain_scores_codex":[0.9965113,0.0009751152,0.0001997977,0.001111559,0.0007974274,0.0004047483],"domain_scores_gemma":[0.9855912,0.007328402,0.0008928516,0.004177159,0.001191,0.0008193907],"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.001643354,0.0004596177,0.004222231,0.0004843111,0.0001833742,0.0003108494,0.001161969,0.3587381,0.01887158,0.3520246,0.03064637,0.2312538],"study_design_scores_gemma":[0.0001491238,0.0001107783,0.0001852294,0.00003350092,0.00002798858,0.0001156791,0.00009352929,0.7537745,0.005119612,0.2367157,0.003634951,0.00003947015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02467962,0.0001749793,0.9664588,0.00124646,0.0001278193,0.0002290643,0.0002739669,0.002826473,0.003982834],"genre_scores_gemma":[0.3519761,0.0002905088,0.6362546,0.001238988,0.0001829013,0.0006522392,0.0008497912,0.0009751004,0.007579695],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00728718,"threshold_uncertainty_score":0.02625513,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02922000910492449,"score_gpt":0.260946489951689,"score_spread":0.2317264808467645,"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."}}