Consecutive retrieval property -- revisited

DOI10.1016/S0020-0190(98)00186-0zbMath1339.68071MaRDI QIDQ294594

K. Gopalakrishnan, Jitender S. Deogun

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019098001860?np=y

zbMATH Keywords

information retrievalconsecutive retrieval propertyunit interval graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Information storage and retrieval of data (68P20) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Normal Helly circular-arc graphs and its subclasses ⋮ Modeling recreational systems using optimization techniques and information technologies ⋮ Rooted directed path graphs are leaf powers ⋮ Consecutive block minimization is 1.5-approximable ⋮ Totally positive matrices and totally positive hypergraphs ⋮ Ptolemaic Graphs and Interval Graphs Are Leaf Powers ⋮ A note on the consecutive ones submatrix problem.

Cites Work

• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Incidence matrices and interval graphs
• On the theory of the consecutive storage of relevant records
• Organization of clustered files for consecutive retrieval
• Faithful Representation of a Family of Sets by a Set of Intervals
• Algorithmic Aspects of Vertex Elimination on Graphs
• File organization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item