An extrinsic characterization of addressable data graphs |
| |
| Authors: | Arnold L Rosenberg |
| |
| Institution: | Mathematical Sciences Department, IBM T.J. Watson Research Center, Yorktown Heights, N.Y. 10598, USA |
| |
| Abstract: | Previous characterizations of the class of addressable data graphs have been intrinsic in nature. In this note, the auxiliary concept of a monoid system is used to derive an extrinsic characterization of the class. Specifically, a partial transformation of the class of data graphs is found which fixes (up to isomorphism) precisely the addressable data graphs. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
