9 citations · 21 across the 18 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
math.CO2021
On Asymptotic Packing of Geometric Graphs
Daniel W. Cranston, Jiaxi Nie, Jacques Verstraëte +1
A set of geometric graphs is {\em geometric-packable} if it can be asymptotically packed into every sequence of drawings of the complete graph . For example, the set of geomet…
cs.DC2021
A tight local algorithm for the minimum dominating set problem in outerplanar graphs
Marthe Bonamy, Linda Cook, Carla Groenland +1
We show that there is a deterministic local algorithm (constant-time distributed graph algorithm) that finds a 5-approximation of a minimum dominating set on outerplanar graphs. We…