An Improved Approach to the PageRank Problems

<table><tr><td><table class="algorithm" id="alg1"><tr><td colspan="2">(1)  Partition the web nodes into dangling and nondangling nodes, so that the hyperlink</td></tr><tr><td colspan="2">   matrix <span class="inline" id="M67"></span> has the structure of (<a href="438987.html#EEq2">4</a>). </td></tr><tr><td colspan="2">(2)  Solve <span class="inline" id="M68"></span> from <span class="inline" id="M69"></span>. </td></tr><tr><td colspan="2">(3)  Compute <span class="inline" id="M70"></span>. </td></tr><tr><td colspan="2">(4)  <span class="inline" id="M71"></span>. </td></tr></table></td></tr></table>

Reordered PageRank Algorithm [<a href="438987.html#B23">22</a>].

Journal of Applied Mathematics

alg1

Algorithm 1

Algorithm 1: An Improved Approach to the PageRank Problems 