Found 1 document(s)
Page 1 of 1
-
With labels of size O(log(n)) for a planar graph, one can check if two vertices are in the same connected component of a subgraph specified by the labels of its deleted vertices and edges....