Algorithms and Models for the Web-Graph: Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004. Proceedings / Edition 1

by Stefano Leonardi

Overview

This volume contains the 14 contributed papers and the contribution of the distinguished invited speaker B´ ela Bollob´ as presented at the 3rd Workshop on Algorithms and Models for the Web-Graph (WAW 2004), held in Rome, Italy, October 16, 2004, in conjunction with the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2004). The World Wide Web has become part of our everyday life and information retrieval and datamining on the Web is now of enormous practical interest. Some of the algorithms supporting these activities are based substantially on viewing the Web as a graph, induced in various ways by links among pages, links among hosts, or other similar networks. Theaim of the 2004 Work shop on Algorithms and Models for the Web-Graph was to further the understanding of these Web-induced graphs, and stimulate the development of high-performance algorithms and applications that use the graphstructure of the Web. The workshop was meant both to foster an exchange of ideas among the diverse set of researchers already involved in this topic, and to act as an introduction for the larger community to the state of the art in this area. This was the third edition of a very successful workshop on this topic, WAW 2002 was held in Vancouver, Canada, in conjunction with the 43rd - nual IEEE Symposium on Foundations of Computer Science, FOCS 2002, and WAW 2003 was held in Budapest, Hungary, in conjunction with the 12th Int- national World Wide Web Conference, WWW 2003. This was the first edition of the workshop with formal proceedings.

Product Details

ISBN-13:	9783540234272
Publisher:	Springer Berlin Heidelberg
Publication date:	11/23/2004
Series:	Lecture Notes in Computer Science , #3243
Edition description:	2004
Pages:	191
Product dimensions:	5.98(w) x 9.02(h) x 0.02(d)

Table of Contents

IBM Invited Lecture.- The Phase Transition and Connectedness in Uniformly Grown Random Graphs.- Contributed Papers.- Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract).- Dominating Sets in Web Graphs.- A Geometric Preferential Attachment Model of Networks.- Traffic-Driven Model of the World Wide Web Graph.- On Reshaping of Clustering Coefficients in Degree-Based Topology Generators.- Generating Web Graphs with Embedded Communities.- Making Eigenvector-Based Reputation Systems Robust to Collusion.- Towards Scaling Fully Personalized PageRank.- Fast PageRank Computation Via a Sparse Linear System (Extended Abstract).- T-Rank: Time-Aware Authority Ranking.- Links in Hierarchical Information Networks.- Crawling the Infinite Web: Five Levels Are Enough.- Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations.- Communities Detection in Large Networks.