Linear probing and graphs

Details Linear probing and graphs Linear probing and graphs

1998-01-15

arxiv.org/abs/cs/9801103v1

Algorithmica 22 (1998), no. 4, 561--568

Computer Science

Data Structures and Algorithms

Scientific paper

Mallows and Riordan showed in 1968 that labeled trees with a small number of inversions are related to labeled graphs that are connected and sparse. Wright enumerated sparse connected graphs in 1977, and Kreweras related the inversions of trees to the so-called ``parking problem'' in 1980. A~combination of these three results leads to a surprisingly simple analysis of the behavior of hashing by linear probing, including higher moments of the cost of successful search.

Affiliated with

Also associated with

No associations

Rating

Linear probing and graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear probing and graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear probing and graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-169945