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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Leonardi, Stefano (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
• Έκδοση: 1st ed. 2004.
• Σειρά: Lecture Notes in Computer Science, 3243
• Θέματα: Computers.; Software engineering.; Algorithms.; Computer science-Mathematics.; Application software.; Information storage and retrieval.; Theory of Computation.; Software Engineering/Programming and Operating Systems.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Information Systems Applications (incl. Internet).; Information Storage and Retrieval.

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...

Πίνακας περιεχομένων:

• 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.