Parameterized Complexity of Streaming Diameter and Connectivity Problems

Documenti analoghi

• The Complexity of Diameter on H-free graphs
  di: Oostveen, Jelle J., et al.
  Pubblicazione: (2024)
• Computing Subset Vertex Covers in $H$-Free Graphs
  di: Brettell, Nick, et al.
  Pubblicazione: (2023)
• Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs
  di: Johnson, Matthew, et al.
  Pubblicazione: (2022)
• On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
  di: Scheffler, Robert
  Pubblicazione: (2025)
• The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching
  di: Dreier, Jan, et al.
  Pubblicazione: (2026)