Sciweavers

2463 search results - page 94 / 493
» Rankings of Directed Graphs
Sort
View
JCT
2006
129views more  JCT 2006»
13 years 9 months ago
A combinatorial proof of the Rogers-Ramanujan and Schur identities
We give a combinatorial proof of the first Rogers-Ramanujan identity by using two symmetries of a new generalization of Dyson's rank. These symmetries are established by direc...
Cilanne Boulet, Igor Pak
WWW
2005
ACM
14 years 10 months ago
Identifying link farm spam pages
With the increasing importance of search in guiding today's web traffic, more and more effort has been spent to create search engine spam. Since link analysis is one of the m...
Baoning Wu, Brian D. Davison
WWW
2004
ACM
14 years 10 months ago
The effect of the back button in a random walk: application for pagerank
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by [5], is used by the Google search engine [4] t...
Fabien Mathieu, Mohamed Bouklit
AINA
2008
IEEE
13 years 11 months ago
Formalization of Link Farm Structure Using Graph Grammar
A link farm is a set of web pages constructed to mislead the importance of target pages in search engine results by boosting their link-based ranking scores. In this paper, we int...
Kiattikun Chobtham, Athasit Surarerks, Arnon Rungs...
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
13 years 10 months ago
Unconditionally reliable message transmission in directed networks
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...