Memory‑Efficient Sketch‑Based Dynamic Connectivity for Dense Graphs
A new system, CUPCaKE, merges parallel updates with graph sketching, using O(V log³ V) memory while answering connectivity queries in O(log V / log log V) time. Read more: getnews.me/memory-efficient-sketch-... #dynamicconnectivity #cupcake