Consecutive retrieval property -- revisited

DOI10.1016/S0020-0190(98)00186-0MaRDI QIDQ294594zbMATH OpenFDO

Authors Jitender Deogun, K. Gopalakrishnan

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

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

Recommendations

• scientific article; zbMATH DE number 3874670
• On the Consecutive-Retrieval Problem
• scientific article; zbMATH DE number 4027515
• scientific article; zbMATH DE number 4095511
• scientific article; zbMATH DE number 3872735

Cites work

• scientific article; zbMATH DE number 3646329 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3481821 (Why is no real title available?)
• scientific article; zbMATH DE number 3307330 (Why is no real title available?)
• Algorithmic Aspects of Vertex Elimination on Graphs
• Faithful Representation of a Family of Sets by a Set of Intervals
• File organization
• Incidence matrices and interval graphs
• On the theory of the consecutive storage of relevant records
• Organization of clustered files for consecutive retrieval
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited in

(9)

• Normal Helly circular-arc graphs and its subclasses
• scientific article; zbMATH DE number 3860441 (Why is no real title available?)
• scientific article; zbMATH DE number 3874670 (Why is no real title available?)
• A note on the consecutive ones submatrix problem.
• Totally positive matrices and totally positive hypergraphs
• Modeling recreational systems using optimization techniques and information technologies
• Ptolemaic Graphs and Interval Graphs Are Leaf Powers
• Rooted directed path graphs are leaf powers
• Consecutive block minimization is 1.5-approximable

This page was built for publication: Consecutive retrieval property -- revisited

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