000 04764nam a22006375i 4500
001 978-3-540-30216-2
003 DE-He213
005 20240423132456.0
007 cr nn 008mamaa
008 121227s2004 gw | s |||| 0|eng d
020 _a9783540302162
_9978-3-540-30216-2
024 7 _a10.1007/b101552
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aAlgorithms and Models for the Web-Graph
_h[electronic resource] :
_bThird International Workshop, WAW 2004, Rome, Italy, October 16, 2004. Proceedings /
_cedited by Stefano Leonardi.
250 _a1st ed. 2004.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2004.
300 _aIX, 191 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v3243
505 0 _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.
520 _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 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.
650 0 _aComputer science.
650 0 _aSoftware engineering.
650 0 _aAlgorithms.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 0 _aApplication software.
650 0 _aInformation storage and retrieval systems.
650 1 4 _aTheory of Computation.
650 2 4 _aSoftware Engineering.
650 2 4 _aAlgorithms.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputer and Information Systems Applications.
650 2 4 _aInformation Storage and Retrieval.
700 1 _aLeonardi, Stefano.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540234272
776 0 8 _iPrinted edition:
_z9783662200384
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v3243
856 4 0 _uhttps://doi.org/10.1007/b101552
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188170
_d188170