One more polynomial complete consecutive retrieval problem

DOI10.1016/0020-0190(77)90034-5MaRDI QIDQ1241287zbMATH OpenOpenAlexFDO

Authors Witold jun. Lipski

Publication date 1977

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

Full work available at URL https://doi.org/10.1016/0020-0190(77)90034-5

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Information storage and retrieval of data (68P20) Analysis of algorithms and problem complexity (68Q25)

Cites work

• scientific article; zbMATH DE number 3559048 (Why is no real title available?)
• scientific article; zbMATH DE number 3564281 (Why is no real title available?)
• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• File organization
• File organization: Consecutive storage of relevant records on drum-type storage
• Information storage and retrieval - mathematical foundations. II: Combinatorial problems
• Polynomial Complete Consecutive Information Retrieval Problems
• Some simplified NP-complete graph problems
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Cited in

(2)

• On an interval \((1, 1)\)-coloring of incidentors of interval colorable graphs
• Two-Dimensional partitioning problems

This page was built for publication: One more polynomial complete consecutive retrieval problem

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