Algorithms and Models for the Web Graph
11th International Workshop, WAW 2014, Beijing, China, December 17-18, 2014, Proceedings
Seiten
2014
|
2014
Springer International Publishing (Verlag)
978-3-319-13122-1 (ISBN)
Springer International Publishing (Verlag)
978-3-319-13122-1 (ISBN)
This book constitutes the refereed proceedings of the 11th International Workshop on Algorithms and Models for the Web Graph, WAW 2014, held in Beijing, China, in December 2014.
The 12 papers presented were carefully reviewed and selected for inclusion in this volume. The aim of the workshop was to further the understanding of graphs that arise from the Web and various user activities on the Web, and stimulate the development of high-performance algorithms and applications that exploit these graphs. The workshop gathered the researchers who are working on graph-theoretic and algorithmic aspects of related complex networks, including social networks, citation networks, biological networks, molecular networks, and other networks arising from the Internet.
The 12 papers presented were carefully reviewed and selected for inclusion in this volume. The aim of the workshop was to further the understanding of graphs that arise from the Web and various user activities on the Web, and stimulate the development of high-performance algorithms and applications that exploit these graphs. The workshop gathered the researchers who are working on graph-theoretic and algorithmic aspects of related complex networks, including social networks, citation networks, biological networks, molecular networks, and other networks arising from the Internet.
Clustering and the Hyperbolic Geometry of Complex Networks.- Burning a Graph as a Model of Social Contagion.- Personalized PageRank with Node-Dependent Restart.- Efficient Computation of the Weighted Clustering Coefficient.- Global Clustering Coefficient in Scale-Free Networks.- Efficient Primal-Dual Graph Algorithms for MapReduce.- Computing Diffusion State Distance Using Green s Function and Heat Kernel on Graphs.- Relational Topic Factorization for Link Prediction in Document Networks.- Firefighting as a Game.- PageRank in Scale-Free Random Graphs.- Modelling of Trends in Twitter Using Retweet Graph Dynamics.- LiveRank: How to Refresh Old Crawls.
Erscheint lt. Verlag | 25.11.2014 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science | Theoretical Computer Science and General Issues |
Zusatzinfo | IX, 161 p. 30 illus. |
Verlagsort | Cham |
Sprache | englisch |
Maße | 155 x 235 mm |
Gewicht | 272 g |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
Schlagworte | Algorithm analysis and problem complexity • algorithmic game theory • algorithms on graphs • Applications • Clustering • Coalitions • Computer Science • conference proceedings • Firefighter Problem • Graph Dynamics • Informatics • Latent Dirichlet Allocation • link prediction • machine learning • matrix factorization • Nash Equilibria • price of anarchy • Random Graph Model • Research • Retweet Graph • Social Networks • Spreading Models for Networks • Twitter |
ISBN-10 | 3-319-13122-2 / 3319131222 |
ISBN-13 | 978-3-319-13122-1 / 9783319131221 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Buch | Softcover (2024)
Lehmanns Media (Verlag)
CHF 55,95
IT zum Anfassen für alle von 9 bis 99 – vom Navi bis Social Media
Buch | Softcover (2021)
Springer (Verlag)
CHF 41,95
Interlingua zur Gewährleistung semantischer Interoperabilität in der …
Buch | Softcover (2023)
Springer Fachmedien (Verlag)
CHF 46,15