论文信息 - Consecutive Retrieval Property-Revisited

Consecutive Retrieval Property-Revisited

The connection between the consecutive retrieval property and interval graphs is explored. Necessary and sufficient conditions for the existence of the consecutive retrieval property are developed from the standpoint of graph theory. These conditions are based on a characterization of unit interval graphs developed in this paper.

Jitender S. Deogun | K. Gopalakrishnan | J. Deogun | K. Gopalakrishnan

[1] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[2] Peter L. Hammer,et al. Difference graphs , 1990, Discret. Appl. Math..

[3] Sakti P. Ghosh. On the theory of consecutive storage of relevant records , 1973, Inf. Sci..

[4] R. Möhring. Algorithmic graph theory and perfect graphs , 1986 .

[5] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..

[6] Vijay V. Raghavan,et al. Organization of clustered files for consecutive retrieval , 1984, TODS.

[7] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .

[8] N. Sloane,et al. Proof Techniques in Graph Theory , 1970 .

[9] George Schick Lueker. Efficient algorithms for chordal graphs and interval graphs. , 1975 .

[10] Sakti P. Ghosh. File organization , 1972, Commun. ACM.

[11] Kapali P. Eswaran,et al. Faithful Representation of a Family of Sets by a Set of Intervals , 1975, SIAM J. Comput..

[12] Kapali P. Eswaran. Placement of Records in a File and File Allocation in a Computer , 1974, IFIP Congress.