An O(log n) round algorithm computes a decomposition of arbitrary amoebot structures into O(number of holes) geodesically convex regions using reconfigurable circuits.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
New enumeration algorithms for minimal removable sets in monotone systems yield O((n+m) log n) time for k-cores and O((n+m) log n)-delay for all k-core subgraphs.
citing papers explorer
-
Logarithmic-Time Geodesically Convex Decomposition in Programmable Matter
An O(log n) round algorithm computes a decomposition of arbitrary amoebot structures into O(number of holes) geodesically convex regions using reconfigurable circuits.