Data graphs and addressing schemes

DOI10.1016/S0022-0000(71)80034-XzbMath0219.68004MaRDI QIDQ2547121

Arnold L. Rosenberg

Publication date: 1971

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Related Items (19)

Diagonal polynomials and diagonal orders on multidimensional lattices ⋮ Cantor Polynomials and the Fueter-Pólya Theorem ⋮ Generalized addressing schemes for data graphs ⋮ An enlarged family of packing polynomials on multidimensional lattices ⋮ An extrinsic characterization of addressable data graphs ⋮ Grundlagen einer Theorie der Datenstrukturen und Zugriffssysteme. I: Datenstrukturen und Schemata ⋮ Perfect Storage Representations for Families of Data Structures ⋮ A model for optimizing indexed file structures ⋮ Data schemata based on directed graphs ⋮ The diagonal polynomials of dimension four ⋮ Relational data graphs and some properties of them ⋮ Addressable approximations to nonaddressable data graphs ⋮ Some decision problems for polynomial mappings ⋮ Polynomial enumeration of multidimensional lattices ⋮ Data types, abstract data types and their specification problem ⋮ Polynomial indexing of integer lattice-points. I. General conceopts and quadratic polynomials ⋮ Exposing graph uniformities via algebraic specification ⋮ Characterizing sets of data structures by the connectivity relation ⋮ Locally finite properties of data structures and their computation

Cites Work

• Bounded action machines: toward an abstract theory of computer structure
• Unnamed Item
• Unnamed Item

This page was built for publication: Data graphs and addressing schemes