most citedAdvice Complexity bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2023★ 1 cited

Advice Complexity bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems

Niklas Berndt, Henri Lotze

Let F be a fixed finite obstruction set of graphs and G be a graph revealed in an online fashion, node by node. The online Delayed F-Node-Deletion Problem (F-Edge-Deletion Problem}…