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

DOI10.1016/0304-3975(76)90023-2MaRDI QIDQ1235990zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A characterisation of rigid circuit graphs
• A Characterization of Comparability Graphs and of Interval Graphs
• Analysis and performance of inverted data base structures
• Combinatorial Configurations
• Faithful Representation of a Family of Sets by a Set of Intervals
• File organization
• File organization schemes based on finite geometries
• File organization: Consecutive storage of relevant records on drum-type storage
• scientific article; zbMATH DE number 3461501 (Why is no real title available?)
• scientific article; zbMATH DE number 3466565 (Why is no real title available?)
• scientific article; zbMATH DE number 3476586 (Why is no real title available?)
• scientific article; zbMATH DE number 3493912 (Why is no real title available?)
• scientific article; zbMATH DE number 3535613 (Why is no real title available?)
• scientific article; zbMATH DE number 3428935 (Why is no real title available?)
• scientific article; zbMATH DE number 3227055 (Why is no real title available?)
• scientific article; zbMATH DE number 3264065 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Incidence matrices and interval graphs
• Incidence matrices, interval graphs and seriation in archeology
• Information storage and retrieval systems: Mathematical foundations
• Intersection properties of finite sets
• Intersection representations of graphs by arcs
• Multidimensional binary search trees used for associative searching
• On the theory of the consecutive storage of relevant records
• Parallel concepts in graph theory
• Representation of a finite graph by a set of intervals on the real line
• The Design of Combinatorial Information Retrieval Systems for Files with Multiple-Valued Attributes
• The intersection graphs of subtrees in trees are exactly the chordal graphs

Cited in

(4)

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

This page was built for publication: Information storage and retrieval - mathematical foundations. II: Combinatorial problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1235990)