{"id":"W3020969699","doi":"10.1137/1.9781611976465.132","title":"The Expander Hierarchy and its Applications to Dynamic Graph Algorithms","year":2021,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Treewidth; Tree decomposition; Algorithm; Computer science; Hierarchy; Dynamic problem; Graph; Mathematics; Theoretical computer science; Combinatorics; Pathwidth; Line 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.001293823,0.0006733637,0.000696747,0.001532488,0.000933244,0.001546828,0.001907013,0.001234948,0.005739812],"category_scores_gemma":[0.006008668,0.0006974593,0.0007705902,0.0022396,0.001768807,0.005579819,0.002904931,0.00342897,0.00110956],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001773507,"about_ca_system_score_gemma":0.0007914327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002578307,"about_ca_topic_score_gemma":0.002317461,"domain_scores_codex":[0.9985147,0.0003653703,0.00005861243,0.000350713,0.0005429712,0.0001676371],"domain_scores_gemma":[0.9968128,0.001695067,0.0002274433,0.0008074963,0.0003097382,0.0001474517],"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.0001424893,0.00008613463,0.0004742726,0.0001692289,0.00003169327,0.0001293105,0.0004435491,0.1252186,0.009449292,0.6915559,0.006395272,0.1659043],"study_design_scores_gemma":[0.00003410434,0.00007196503,0.0003074732,0.00003714468,0.00001789265,0.0002345624,0.00008000061,0.4949307,0.004539977,0.474241,0.02547133,0.00003376402],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.009593713,0.000998235,0.9772574,0.0007067578,0.00004749037,0.00006138295,0.0001114546,0.0008672592,0.01035628],"genre_scores_gemma":[0.272883,0.002009254,0.7128554,0.0006587884,0.000245553,0.000257589,0.0004425858,0.0004423744,0.01020552],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.005739812,"threshold_uncertainty_score":0.01920158,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06587450508378731,"score_gpt":0.2717993298694636,"score_spread":0.2059248247856763,"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."}}