Algorithms and Models for the Web-Graph: Third International Workshop, WAW 2004, Rome, Italy, October 16, 2004, Proceeedings

✍ Scribed by Béla Bollobás, Oliver Riordan (auth.), Stefano Leonardi (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 2004
• Tongue: English
• Leaves: 196
• Series: Lecture Notes in Computer Science 3243
• Edition: 1
• Category: Library

✦ Synopsis

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 retrievalanddataminingontheWebisnowofenormouspracticalinterest.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. Theaimofthe2004WorkshoponAlgorithmsandModelsfortheWeb-Graph was to further the understanding of these Web-induced graphs, and stimulate the development of high-performance algorithms and applications that use the graphstructureoftheWeb.Theworkshopwasmeantbothtofosteranexchange 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 ?rst edition of the workshop with formal proceedings.

✦ Table of Contents

Front Matter....Pages -
The Phase Transition and Connectedness in Uniformly Grown Random Graphs....Pages 1-18
Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract)....Pages 19-30
Dominating Sets in Web Graphs....Pages 31-43
A Geometric Preferential Attachment Model of Networks....Pages 44-55
Traffic-Driven Model of the World Wide Web Graph....Pages 56-67
On Reshaping of Clustering Coefficients in Degree-Based Topology Generators....Pages 68-79
Generating Web Graphs with Embedded Communities....Pages 80-91
Making Eigenvector-Based Reputation Systems Robust to Collusion....Pages 92-104
Towards Scaling Fully Personalized PageRank....Pages 105-117
Fast PageRank Computation Via a Sparse Linear System (Extended Abstract)....Pages 118-130
T-Rank: Time-Aware Authority Ranking....Pages 131-142
Links in Hierarchical Information Networks....Pages 143-155
Crawling the Infinite Web: Five Levels Are Enough....Pages 156-167
Do Your Worst to Make the Best: Paradoxical Effects in PageRank Incremental Computations....Pages 168-180
Communities Detection in Large Networks....Pages 181-187
Back Matter....Pages -

✦ Subjects

Algorithm Analysis and Problem Complexity; Discrete Mathematics in Computer Science; Information Systems Applications (incl.Internet); Information Storage and Retrieval; Computer Communication Networks; Database Management