Segev Shlomov, Avi Yaeli
CHI 2024
There is given an undirected graph G -- (V, E) from which edges are deleted one at a time and about which questions of the type, “Are the vertices u and v in the same connected component?” have to be answered “on-line.” There is presented an algorithm which maintains a data structure in which each question is answered in constant time and for which the total time involved in answering q questions and maintaining the data structure is O(q + I VI lED. © 1981, ACM. All rights reserved.
Segev Shlomov, Avi Yaeli
CHI 2024
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014
Takeshi Yoshimura
PyTorch Conference 2026
Amarachi Blessing Mbakwe, Joy Wu, et al.
NeurIPS 2023