线性探测和图形
Linear probing and graphs
摘要：
Mallows和Riordan在1968年证明了具有少量反转的标记树与连通和稀疏的标记图相关。Wright在1977年列举了稀疏连通图，Kreweras在1980年将树的反转与所谓的“停车问题”联系起来。这三个结果的~组合导致通过线性探测对散列的行为进行令人惊讶的简单分析，包括成功搜索的成本的较高时刻。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
