Consecutive retrieval property -- revisited
DOI10.1016/S0020-0190(98)00186-0zbMATH Open1339.68071MaRDI QIDQ294594FDOQ294594
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
Recommendations
Information storage and retrieval of data (68P20) Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Incidence matrices and interval graphs
- Title not available (Why is that?)
- Algorithmic Aspects of Vertex Elimination on Graphs
- Organization of clustered files for consecutive retrieval
- On the theory of the consecutive storage of relevant records
- Title not available (Why is that?)
- Faithful Representation of a Family of Sets by a Set of Intervals
- Title not available (Why is that?)
- File organization
Cited In (9)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Normal Helly circular-arc graphs and its subclasses
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)
