File organization - MaRDI portal

Cited in

(24)

Preemptive scheduling and antichain polyhedra
Consecutive retrieval with redundancy: An optimal linear and an optimal cyclic arrangement and their storage space requirements
On the storage space requirement of consecutive retrieval with redundancy
Information storage and retrieval - mathematical foundations. II: Combinatorial problems
Partition of a query set into minimal number of subsets having consecutive retrieval property
One more polynomial complete consecutive retrieval problem
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
On identification of CR property in file organisation
On testing consecutive-ones property in parallel
On the consecutive ones property
Algorithmic characterizations of interval orderd hypergraphs and applications
A multichannel storage arrangement scheme of pictorial databases for concurrent spatial match retrieval
A conjunctive parallelogram model for Pick any/\(n\) data
Obtaining matrices with the consecutive ones property by row deletions
Polynomial-time local-improvement algorithm for consecutive block minimization
Minimising the number of gap-zeros in binary matrices
On Robinsonian dissimilarities, the consecutive ones property and latent variable models
Consecutive retrieval property -- revisited
Polyhedral Reformulation of a Scheduling Problem And Related Theoretical Results
Algorithmic approach to the consecutive retrieval property
Modeling recreational systems using optimization techniques and information technologies
Bridges between deterministic and probabilistic models for binary data
Consecutive ones property and PQ-trees for multisets: hardness of counting their orderings
On the consecutive retrieval property for generalized binary queries

This page was built for publication: File organization

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