Information storage and retrieval - mathematical foundations. II: Combinatorial problems

DOI10.1016/0304-3975(76)90023-2zbMath0352.68121OpenAlexW2017194685MaRDI QIDQ1235990

Witold jun. Lipski

Publication date: 1977

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(76)90023-2

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Information storage and retrieval of data (68P20)

Related Items

The arborescence-realization problem ⋮ A simple algorithm for finding a cycle of length greater than three and without diagonals ⋮ One more polynomial complete consecutive retrieval problem ⋮ The edge intersection graphs of paths in a tree

Cites Work

• Information storage and retrieval systems: Mathematical foundations
• Parallel concepts in graph theory
• A characterisation of rigid circuit graphs
• Incidence matrices and interval graphs
• Incidence matrices, interval graphs and seriation in archeology
• Intersection representations of graphs by arcs
• Intersection properties of finite sets
• On the theory of the consecutive storage of relevant records
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Representation of a finite graph by a set of intervals on the real line
• Faithful Representation of a Family of Sets by a Set of Intervals
• Analysis and performance of inverted data base structures
• Multidimensional binary search trees used for associative searching
• File organization: Consecutive storage of relevant records on drum-type storage
• File organization schemes based on finite geometries
• The Design of Combinatorial Information Retrieval Systems for Files with Multiple-Valued Attributes
• Combinatorial Configurations
• File organization
• A Characterization of Comparability Graphs and of Interval Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item