From 55ddd5b2efac992ec06ecc8fe2c690fabe845a54 Mon Sep 17 00:00:00 2001 From: Martin Mares Date: Sat, 13 Sep 2008 17:55:20 +0200 Subject: [PATCH] All refs to ranking hopefully gone. --- ram.tex | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/ram.tex b/ram.tex index e2609ba..87bed0c 100644 --- a/ram.tex +++ b/ram.tex @@ -538,8 +538,8 @@ principles behind them are ubiquitous in many other data structures and these will serve us well and often. We are going to build the theory of Q-heaps in Section \ref{qheaps}, which will later lead to a~linear-time MST algorithm for arbitrary integer weights in Section \ref{iteralg}. Other such structures -will help us in building linear-time RAM algorithms for computing the ranks -of various combinatorial structures in Chapter~\ref{rankchap}. +are important ingredients of linear-time algorithms for ranking of combinatorial +structures \cite{mm:rank}. Outside our area, important consequences of RAM data structures include the Thorup's $\O(m)$ algorithm for single-source shortest paths in undirected -- 2.39.2