Faithful Representation of a Family of Sets by a Set of Intervals

DOI10.1137/0204005zbMATH Open0294.68007OpenAlexW2015583196MaRDI QIDQ4047089FDOQ4047089

Authors: Kapali P. Eswaran 

Publication date: 1975

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0204005

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20)

Cited In (9)

• Partition of a query set into minimal number of subsets having consecutive retrieval property
• Interval hypergraphs and D-interval hypergraphs
• Consecutive retrieval property -- revisited
• On a certain numbering of the vertices of a hypergraph
• Characterization problems for graphs, partially ordered sets, lattices, and families of sets
• Algorithmic approach to the consecutive retrieval property
• Hypergraphs and intervals
• A type of algebraic structure related to sets of intervals
• Information storage and retrieval - mathematical foundations. II: Combinatorial problems

This page was built for publication: Faithful Representation of a Family of Sets by a Set of Intervals

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