Kontakt
Kako kupovati
Dostava
Savjetnik za kupnju
On Graph Isomorphism and the Pagerank Algorithm
Engleski
125 b
30 dana za povrat kupljenih proizvoda
Kupci su kupili i
/
Meki uvez
6.77
€
/
Meki uvez
42.79
€
Graphs express relationships among objects, such as the radio connectivity among nodes in unmanned vehicle swarms. Some applications may rank a swarm's nodes by their relative importance, for example, using the PageRank algorithm applied in certain search engines to order query responses. The PageRank values of the nodes correspond to a unique eigenvector that can be computed using the power method, an iterative technique based on matrix multiplication. The first result is a practical lower bound on the PageRank algorithm's execution time that is derived by applying assumptions to the PageRank perturbation's scaling value and the PageRank vector's required numerical precision. The second result establishes nodes contained in the same block of the graph's coarsest equitable partition must have equal PageRank values. The third result, the AverageRank algorithm, ensures such nodes are assigned equal PageRank values. The fourth result, the ProductRank algorithm, reduces the time needed to find the PageRank vector by eliminating certain dot products in the power method if the graph's coarsest equitable partition contains blocks composed of multiple vertices.
Informacije o knjizi
Engleski
Poklonite ovu knjigu još danas
To je jednostavno
1 Dodajte knjigu u košaricu i odaberite isporuku kao poklon 2 Zauzvrat ćemo vam poslati kupon 3 Knjiga dolazi na adresu poklonoprimcaMoglo bi vas zanimati i
/
Tvrdi uvez
153.38
€
/
Tvrdi uvez
83.66
€
/
Meki uvez
14.86
€
/
Tvrdi uvez
130.00
€
