Information storage and retrieval — mathematical foundations II (combinatorial problems)

This publication has 21 references indexed in Scilit:

• Multidimensional binary search trees used for associative searching
  Communications of the ACM, 1975
• Analysis and performance of inverted data base structures
  Communications of the ACM, 1975
• Faithful Representation of a Family of Sets by a Set of Intervals
  SIAM Journal on Computing, 1975
• A characterisation of rigid circuit graphs
  Discrete Mathematics, 1974
• The intersection graphs of subtrees in trees are exactly the chordal graphs
  Journal of Combinatorial Theory, Series B, 1974
• The Design of Combinatorial Information Retrieval Systems for Files with Multiple-Valued Attributes
  SIAM Journal on Applied Mathematics, 1969
• File organization schemes based on finite geometries
  Information and Control, 1968
• Incidence matrices and interval graphs
  Pacific Journal of Mathematics, 1965
• Representation of a finite graph by a set of intervals on the real line
  Fundamenta Mathematicae, 1962
• ON THE TOPOLOGY OF THE GENETIC FINE STRUCTURE
  Proceedings of the National Academy of Sciences, 1959