An Improved Approach to the PageRank Problems

<table class="table-group" width="800px"><tr class="fig-image" id="fig1a"><td><img alt="438987.fig.001a" src="https://static.hindawi.com/articles/jam/volume-2013/438987/figures/438987.fig.001a.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(a) </b>The structure before the separation</td></tr></table></td></tr><tr class="fig-image" id="fig1b"><td><img alt="438987.fig.001b" src="https://static.hindawi.com/articles/jam/volume-2013/438987/figures/438987.fig.001b.jpg"/></td></tr><tr class="fig-caption"><td align="center"><table><tr><td><b>(b) </b>The structure after the separation</td></tr></table></td></tr></table>

<table>A separation of the common nodes for a web link graph which has four blocks.</table>

Journal of Applied Mathematics

fig1

Figure 1

Figure 1: An Improved Approach to the PageRank Problems 