87 citations · 137 across the 23 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CG2017
Time-Space Trade-Offs for Computing Euclidean Minimum Spanning Trees
Bahareh Banyassady, Luis Barba, Wolfgang Mulzer
We present time-space trade-offs for computing the Euclidean minimum spanning tree of a set of point-sites in the plane. More precisely, we assume that resides in a ran…
cs.DS2017
Dynamic Graph Coloring
Luis Barba, Jean Cardinal, Matias Korman +4
In this paper we study the number of vertex recolorings that an algorithm needs to perform in order to maintain a proper coloring of a graph under insertion and deletion of vertice…