×

zbMATH — the first resource for mathematics

Algorithms and models for the web graph. 10th international workshop, WAW 2013, Cambridge, MA, USA, December 14–15, 2013. Proceedings. (English) Zbl 1298.68022
Lecture Notes in Computer Science 8305. Berlin: Springer (ISBN 978-3-319-03535-2/pbk). x, 233 p. (2013).

Show indexed articles as search result.

The articles of this volume will be reviewed individually. For the preceding workshop see [Zbl 1241.68009].
Indexed articles:
Janssen, Jeannette; Prałat, Paweł; Wilson, Rory, Asymmetric distribution of nodes in the spatial preferred attachment model, 1-13 [Zbl 1342.05142]
Jacob, Emmanuel; Mörters, Peter, A spatial preferential attachment model with local clustering, 14-25 [Zbl 1342.05141]
Chung, Fan; Kempton, Mark, A local clustering algorithm for connection graphs, 26-43 [Zbl 1342.05158]
Brautbar, Michael; Draief, Moez; Khanna, Sanjeev, On the power of adversarial infections in networks, 44-55 [Zbl 1342.68038]
Avrachenkov, Konstantin; Gonçalves, Paulo; Sokol, Marina, On the choice of kernel and labelled data in semi-supervised learning methods, 56-67 [Zbl 1342.68265]
Kloster, Kyle; Gleich, David F., A nearly-sublinear method for approximating a column of the matrix exponential for matrices from large, sparse networks, 68-79 [Zbl 1342.05165]
Lefortier, Damien; Ostroumova, Liudmila; Samosvat, Egor, Evolution of the media web, 80-92 [Zbl 1342.68039]
Bloznelis, Mindaugas; Karoński, Michał, Random intersection graph process, 93-105 [Zbl 1342.05133]
Avrachenkov, Konstantin; Litvak, Nelly; Medyanikov, Vasily; Sokol, Marina, Alpha current flow betweenness centrality, 106-117 [Zbl 1342.05153]
Mamageishvili, Akaki; Mihalák, Matúš; Müller, Dominik, Tree Nash equilibria in the network creation game, 118-129 [Zbl 1342.05169]
Cooper, Colin; Radzik, Tomasz; Siantos, Yiannis, Fast low-cost estimation of network properties using random walks, 130-143 [Zbl 1342.05148]
Xu, Rupei, An \(L _{p }\) norm relaxation approach to positive influence maximization in social network under the deterministic linear threshold model, 144-155 [Zbl 1343.91042]
Pattabiraman, Bharath; Patwary, Md. Mostofa Ali; Gebremedhin, Assefaw H.; Liao, Wei-keng; Choudhary, Alok, Fast algorithms for the maximum clique problem on massive sparse graphs, 156-169 [Zbl 1342.05185]
Goel, Keshav; Singh, Rishi Ranjan; Iyengar, Sudarshan; Sukrit, A faster algorithm to update betweenness centrality after node alteration, 170-184 [Zbl 1342.05032]
Ostroumova, Liudmila; Ryabchenko, Alexander; Samosvat, Egor, Generalized preferential attachment: tunable power-law degree distribution and clustering coefficient, 185-202 [Zbl 1347.68020]
Chung, Fan; Simpson, Olivia, Solving linear systems with boundary conditions using heat kernel PageRank, 203-219 [Zbl 1342.05057]
Graham, Ronald; Hamilton, Linus; Levavi, Ariel; Loh, Po-Shen, Anarchy is free in network creation, 220-231 [Zbl 1342.68036]

MSC:
68-06 Proceedings, conferences, collections, etc. pertaining to computer science
68M11 Internet topics
68R10 Graph theory (including graph drawing) in computer science
00B25 Proceedings of conferences of miscellaneous specific interest
PDF BibTeX Cite
Full Text: DOI