One more polynomial complete consecutive retrieval problem

DOI10.1016/0020-0190(77)90034-5zbMath0365.68048OpenAlexW1975550929MaRDI QIDQ1241287

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

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

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some simplified NP-complete graph problems
• Information storage and retrieval - mathematical foundations. II: Combinatorial problems
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• File organization: Consecutive storage of relevant records on drum-type storage
• Polynomial Complete Consecutive Information Retrieval Problems
• File organization

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