College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||A Linear Time Algorithm for the Generalized Consecutive Retrieval Problem|
|Authors: ||Dietz, Paul F.|
Hopcroft, John E.
|Keywords: ||computer science|
|Issue Date: ||Jul-1979|
|Publisher: ||Cornell University|
|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.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.