Isomorphism Testing and Display of Symmetries in Dynamic Trees

@inproceedings{Cheng1996IsomorphismTA,
  title={Isomorphism Testing and Display of Symmetries in Dynamic Trees},
  author={Siu-Wing Cheng and Moon-Pun Ng},
  booktitle={SODA},
  year={1996}
}
We describe data structures for maintaining a set of trees so that isomorphism testing for any two trees can be performed in O(1) time. Updates include inserting an edge to merge two trees or removing an edge to split a tree into two smaller trees. Each update can be performed in O(log’ n log m log’ m) time, where n is the total size of trees involved and m is the number of updates performed so far. The space needed per update is O(log2n(log* m + logn)). We apply this result to display… CONTINUE READING