No label defined (Q3222216)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3887720
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3887720

      Statements

      0 references
      1982
      0 references
      classification scheme
      0 references
      numbered tree
      0 references
      [For the first part see ibid. 42, 38-50 (1982; Zbl 0541.05006).] The motivation for this paper is the author's conjecture that ''in any large library, however well designed it is, there will be dislocations - that is, there will exist categories of books on ''closely related'' subjects which are shelved ''far apart'', as if they were not closely related, not because of a clerical error but as part of the shelving scheme''. A classification scheme that resolves this problem is devised; the scheme is based on what the author calls a numbered tree. A numbered tree may be pictured as a plane drawing of an oriented rooted tree with edges oriented away from the root. Each vertex v is labeled with its outdegree od(v) and the out-edges from v are labeled 0 through od(v)-1 clockwise from the in-edge. Let T be a numbered tree in which all vertices the same distance from the root have the same outdegree. An integer value function is now defined on the set of directed paths of T whose initial vertex is the root of T. This function is shown to provide a classification scheme that resolves the original problem.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references