Research and Advances

Remark on uniform insertion in structured data structures

In a recent paper, Shneiderman and Scheuermann [1] have defined an interesting operation, called uniform insertion, whereby a (linked) data structure G2 can be embedded within another structure G1 in such a way that each data node of G1 serves as an entry node for G2. This communication points out and corrects an error in their definition, while preserving the spirit of that operation.

Advertisement

Author Archives

Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved