LEADER 05971nam 22008295 450 001 9910767535503321 005 20240805231805.0 010 $a3-540-30216-6 024 7 $a10.1007/b101552 035 $a(CKB)1000000000212600 035 $a(SSID)ssj0000101090 035 $a(PQKBManifestationID)11109028 035 $a(PQKBTitleCode)TC0000101090 035 $a(PQKBWorkID)10037265 035 $a(PQKB)10088579 035 $a(PQKBManifestationID)16120399 035 $a(PQKB)21359234 035 $a(DE-He213)978-3-540-30216-2 035 $a(MiAaPQ)EBC3087335 035 $a(PPN)155200631 035 $a(EXLCZ)991000000000212600 100 $a20121227d2004 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acz 200 10$aAlgorithms and Models for the Web-Graph $eThird International Workshop, WAW 2004, Rome, Italy, October 16, 2004. Proceedings /$fedited by Stefano Leonardi 205 $a1st ed. 2004. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2004. 215 $a1 online resource (IX, 191 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v3243 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-23427-6 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aIBM 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. 330 $aThis 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 data mining 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. The aim of the 2004 Workshop 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 graph structure 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 - annual IEEE Symposium on Foundations of Computer Science, FOCS 2002, and WAW 2003 was held in Budapest, Hungary, in conjunction with the 12th International World Wide Web Conference, WWW 2003. This was the first edition of the workshop with formal proceedings. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v3243 606 $aComputers 606 $aSoftware engineering 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aApplication software 606 $aInformation storage and retrieval 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aSoftware Engineering/Programming and Operating Systems$3https://scigraph.springernature.com/ontologies/product-market-codes/I14002 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028 606 $aInformation Systems Applications (incl. Internet)$3https://scigraph.springernature.com/ontologies/product-market-codes/I18040 606 $aInformation Storage and Retrieval$3https://scigraph.springernature.com/ontologies/product-market-codes/I18032 615 0$aComputers. 615 0$aSoftware engineering. 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aApplication software. 615 0$aInformation storage and retrieval. 615 14$aTheory of Computation. 615 24$aSoftware Engineering/Programming and Operating Systems. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aInformation Systems Applications (incl. Internet). 615 24$aInformation Storage and Retrieval. 676 $a005.1 702 $aLeonardi$b Stefano$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aWorkshop on Algorithms and Models for the Web-Graph 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910767535503321 996 $aAlgorithms and Models for the Web-Graph$9772606 997 $aUNINA