One more polynomial complete consecutive retrieval problem
type: Item
instance of: scholarly article
title: One more polynomial complete consecutive retrieval problem
zbMATH Open document ID: 0365.68048
DOI: 10.1016/0020-0190(77)90034-5
published in: Information Processing Letters
publication date: 1977-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 05A99
zbMATH DE Number: 3569831
author: Witold jun. Lipski
MaRDI profile type: Publication
full work available at URL: 0020-0190(77)90034-5
OpenAlex ID: W1975550929
cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
cites work: Some simplified NP-complete graph problems
cites work: File organization
cites work: File organization: Consecutive storage of relevant records on drum-type storage
cites work: Q4142699
cites work: Polynomial Complete Consecutive Information Retrieval Problems
cites work: Information storage and retrieval - mathematical foundations. II: Combinatorial problems
cites work: Q4136507
cites work: Q4131073
description: scientific article; zbMATH DE number 3569831