Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Remark on uniform insertion in structured data structures

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 G 2 can be embedded within another structure G 1 in such a way that each data node of G 1 serves as an entry node for G 2 . This communication points out and corrects an error in their definition, while preserving the spirit of that operation. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications of the ACM Association for Computing Machinery

Remark on uniform insertion in structured data structures

Hollander, Clifford R.
Communications of the ACM , Volume 20 (4) – Apr 1, 1977
Download PDF
2 pages

Loading next page...
 
/lp/association-for-computing-machinery/remark-on-uniform-insertion-in-structured-data-structures-qXj4HKg4GH

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1977 by ACM Inc.
ISSN
0001-0782
DOI
10.1145/359461.359476
Publisher site
See Article on Publisher Site

Abstract

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

Journal

Communications of the ACM – Association for Computing Machinery

Published: Apr 1, 1977

There are no references for this article.