Showing 2023Show all
2 papers · 1 filter
cs.DM2023
Words fixing the kernel network and maximum independent sets in graphs
Maximilien Gadouleau, David C. Kutner
The simple greedy algorithm to find a maximal independent set of a graph can be viewed as a sequential update of a Boolean network, where the update function at each vertex is the…
cs.DM2023
Temporal Reachability Dominating Sets: contagion in temporal graphs
David C. Kutner, Laura Larios-Jones
Given a population with dynamic pairwise connections, we ask if the entire population could be (indirectly) infected by a small group of initially infected individuals. We form…