A Tight Meta-theorem for LOCAL Certification of MSO$_2$ Properties within Bounded Treewidth Graphs

Documenti analoghi

• Local certification of forbidden subgraphs
  di: Bousquet, Nicolas, et al.
  Pubblicazione: (2024)
• GenTT: Generate Vectorized Codes for General Tensor Permutation
  di: Chen, Yaojian, et al.
  Pubblicazione: (2025)
• Fast algorithms for Vizing's theorem on bounded degree graphs
  di: Bernshteyn, Anton, et al.
  Pubblicazione: (2023)
• A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
  di: Chang, Yi-Jun, et al.
  Pubblicazione: (2023)
• Parallelizing the Approximate Minimum Degree Ordering Algorithm: Strategies and Evaluation
  di: Chang, Yen-Hsiang, et al.
  Pubblicazione: (2025)