Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/7501
Title: A Linear Time Algorithm for the Generalized Consecutive Retrieval Problem
Authors: Dietz, Paul F.
Furst, Merrick
Hopcroft, John E.
Keywords: computer science
technical report
Issue Date: Jul-1979
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR79-386
Abstract: THe Generalized Consecutive Retrieval Problem (GCRP) is to find a directed tree on $n$ records in which each of $k$ subsets forms a directed path. The problem arises in organizing information for efficient retrieval. A linear time algorithm for the GCRP is given. Further generalization leads to problems that are complete for NP.
URI: http://hdl.handle.net/1813/7501
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
79-386.pdf1.54 MBAdobe PDFView/Open
79-386.ps628.09 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us