{"id":"W3116404732","doi":"10.4230/lipics.fsttcs.2020.33","title":"Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; University of Victoria","keywords":"Algorithm; Computer science; Amortized analysis; Distributed algorithm; Vertex (graph theory); Sublinear function; Sequence (biology); Deterministic algorithm; Computation; Degree (music); Parallel algorithm; Combinatorics; Graph; Mathematics; Theoretical computer science; Data structure","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.001956018,0.001038471,0.00107618,0.0009073002,0.001053675,0.002119731,0.003498985,0.001197749,0.005207871],"category_scores_gemma":[0.00605351,0.0006887738,0.0008331418,0.001757569,0.001210089,0.004693164,0.003003726,0.001765712,0.0009698152],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001924966,"about_ca_system_score_gemma":0.001953017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002019164,"about_ca_topic_score_gemma":0.002890581,"domain_scores_codex":[0.9973701,0.0005453058,0.0001562087,0.0008711045,0.0007024169,0.0003547843],"domain_scores_gemma":[0.9956813,0.002024067,0.0003395504,0.001338484,0.0004298597,0.0001866211],"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.001175731,0.0003300483,0.001318581,0.0005716442,0.0001312682,0.0001117557,0.0003013931,0.4545992,0.01072108,0.204933,0.01413714,0.3116691],"study_design_scores_gemma":[0.00010472,0.00009277299,0.0001975687,0.00002160105,0.00002667831,0.000130233,0.00004142679,0.8360578,0.003729699,0.1537945,0.005781554,0.00002141952],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01805046,0.000575407,0.9734436,0.0004383107,0.00007423243,0.0001609451,0.0002802059,0.001714883,0.005261966],"genre_scores_gemma":[0.3558208,0.0004341912,0.6359782,0.0002832507,0.0001306775,0.0004153133,0.001152639,0.0005530479,0.005231842],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005207871,"threshold_uncertainty_score":0.01742202,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03316991790132955,"score_gpt":0.2747681144222525,"score_spread":0.2415981965209229,"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."}}