Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Characterizing and Testing Configuration Stability in Two-Dimensional Threshold Cellular Automata
Yonatan Nakar, Dana Ron
We consider the problems of characterizing and testing the stability of cellular automata configurations that evolve on a two-dimensional torus according to threshold rules with re…
cs.DS2025
Approximately Counting and Sampling Hamiltonian Motifs in Sublinear Time
Talya Eden, Reut Levi, Dana Ron +1
Counting small subgraphs, referred to as motifs, in large graphs is a fundamental task in graph analysis, extensively studied across various contexts and computational models. In t…
cs.DS2024
Testing -freeness in bounded-arboricity graphs
Talya Eden, Reut Levi, Dana Ron
We study the problem of testing -freeness (-cycle-freeness) for fixed constant in graphs with bounded arboricity (but unbounded degrees). In particular, we are inte…