1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.CO2024★ 1 cited
Hypergraph burning, matchings, and zero forcing
Anthony Bonato, Caleb Jones, Trent G. Marbach +2
Lazy burning is a recently introduced variation of burning where only one set of vertices is chosen to burn in the first round. In hypergraphs, lazy burning spreads when all but on…
cs.SI2024
Clique counts for network similarity
Anthony Bonato, Zhiyuan Zhang
Counts of small subgraphs, or graphlet counts, are widely applicable to measure graph similarity. Computing graphlet counts can be computationally expensive and may pose obstacles…