Cycle detection in colored m x n grid graphs requires reading all mn cells in the worst case.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Tight Lower Bound for Cycle Detection in Grid Graphs
Cycle detection in colored m x n grid graphs requires reading all mn cells in the worst case.