Login / Signup

Advice Complexity Bounds for Online Delayed ℱ-Node-, H-Node- and H-Edge-Deletion Problems.

Niklas BerndtHenri Lotze
Published in: IWOCA (2023)
Keyphrases
  • complexity bounds
  • directed graph
  • tree structure
  • np complete