000 04129nam a22006015i 4500
001 978-3-319-03536-9
003 DE-He213
005 20240730195304.0
007 cr nn 008mamaa
008 131209s2013 sz | s |||| 0|eng d
020 _a9783319035369
_9978-3-319-03536-9
024 7 _a10.1007/978-3-319-03536-9
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aAlgorithms and Models for the Web Graph
_h[electronic resource] :
_b10th International Workshop, WAW 2013, Cambridge, MA, USA, December 14-15, 2013, Proceedings /
_cedited by Anthony Bonato, Michael Mitzenmacher, Pawel Pralat.
250 _a1st ed. 2013.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2013.
300 _aX, 233 p. 40 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8305
505 0 _aAsymmetric Distribution of Nodes in the Spatial Preferred Attachment Model -- A Spatial Preferential Attachment Model with Local Clustering -- A Local Clustering Algorithm for Connection -- On the Power of Adversarial Infections in Networks -- On the Choice of Kernel and Labelled Data in Semi-supervised Learning Methods -- A Nearly-Sublinear Method for Approximating a Column of the Matrix Exponential for Matrices from Large, Sparse Networks -- Evolution of the Media Web -- Random Intersection Graph Process -- Alpha Current Flow Betweenness Centrality -- Tree Nash Equilibria in the Network Creation Game -- Fast Low-Cost Estimation of Network Properties Using Random Walks -- An Lp Norm Relaxation Approach to Positive Influence Maximization in Social Network under the Deterministic Linear Threshold Model -- Fast Algorithms for the Maximum Clique Problem on Massive Sparse -- A Faster Algorithm to Update Betweenness Centrality after Node Alteration -- Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient -- Solving Linear Systems with Boundary Conditions Using Heat Kernel Pagerank -- Anarchy Is Free in Network Creation.
520 _aThis book constitutes the refereed proceedings of the 10th International Workshop on Algorithms and Models for the Web Graph, WAW 2013, held in Cambridge, MA, USA, in December 2013. The 17 papers presented were carefully reviewed and selected for inclusion in this volume. They address topics related to graph-theoretic and algorithmic aspects of related complex networks, including citation networks, social networks, biological networks, molecular networks and other networks arising from the Internet.
650 0 _aAlgorithms.
_93390
650 0 _aComputer science
_xMathematics.
_93866
650 0 _aDiscrete mathematics.
_912873
650 0 _aData mining.
_93907
650 0 _aInformation storage and retrieval systems.
_922213
650 1 4 _aAlgorithms.
_93390
650 2 4 _aDiscrete Mathematics in Computer Science.
_931837
650 2 4 _aData Mining and Knowledge Discovery.
_9159758
650 2 4 _aInformation Storage and Retrieval.
_923927
700 1 _aBonato, Anthony.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9159759
700 1 _aMitzenmacher, Michael.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_9159760
700 1 _aPralat, Pawel.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
_971630
710 2 _aSpringerLink (Online service)
_9159761
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783319035352
776 0 8 _iPrinted edition:
_z9783319035376
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v8305
_9159762
856 4 0 _uhttps://doi.org/10.1007/978-3-319-03536-9
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cELN
999 _c95560
_d95560