Reference Work Entry

Encyclopedia of Algorithms

pp 1117-1121

Date:

List Ranking

  • Riko JacobAffiliated withInstitute of Computer Science, Technical University of MunichIT University of Copenhagen Email author 
  • , Ulrich MeyerAffiliated withDepartment of Computer Science, Goethe University Fankfurt am Main
  • , Laura TomaAffiliated withDepartment of Computer Science, Bowdoin College

Keywords

3-coloring Euler Tour External memory algorithms Graph algorithms Independent set PRAM algorithms Time-forward processing

Years and Authors of Summarized Original Work

  • 1995; Chiang, Goodrich, Grove, Tamassia, Vengroff, Vitter

Problem Definition

Let L be a linked list of n vertices x1, x2, , xn such that every vertex xi stores a pointer \(succ(x_{i})\) to its successor in L. As with any linked list, we assume that no two vertices have the same successor, any vertex can reach the tail of the list by following successor pointers, and we denote the head of the list the vertex that no other vertex in L points to and the tail the vertex whose successor is null. Given the head xh of L, the list-ranking problem is to find the rank, or distance, of each vertex xi in L from the head of L: that is, ...

This is an excerpt from the content