Normal view MARC view ISBD view

Algorithms and Models for the Web Graph [electronic resource] : 9th International Workshop, WAW 2012, Halifax, NS, Canada, June 22-23, 2012. Proceedings / edited by Anthony Bonato, Jeannette Janssen.

By: Bonato, Anthony [editor.].
Contributor(s): Janssen, Jeannette [editor.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Lecture Notes in Computer Science: 7323Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2012Description: VIII, 179 p. 30 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642305412.Subject(s): Computer science | Computer Communication Networks | Computer software | Computational complexity | Data mining | Information storage and retrieval systems | Computer Science | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer Science | Information Systems Applications (incl. Internet) | Data Mining and Knowledge Discovery | Computer Communication Networks | Information Storage and RetrievalDDC classification: 005.1 Online resources: Click here to access online In: Springer eBooksSummary: This book constitutes the refereed proceedings of the 9th International Workshop on Algorithms and Models for the Web-Graph, WAW 2012, held in Halifax, Nova Scotia, Canada, in June 2012. The 13 papers presented were carefully reviewed and selected for inclusion in this volume. They address a number of topics related to the complex networks such hypergraph coloring games and voter models; algorithms for detecting nodes with large degrees; random Appolonian networks; and a sublinear algorithm for Pagerank computations.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

This book constitutes the refereed proceedings of the 9th International Workshop on Algorithms and Models for the Web-Graph, WAW 2012, held in Halifax, Nova Scotia, Canada, in June 2012. The 13 papers presented were carefully reviewed and selected for inclusion in this volume. They address a number of topics related to the complex networks such hypergraph coloring games and voter models; algorithms for detecting nodes with large degrees; random Appolonian networks; and a sublinear algorithm for Pagerank computations.

There are no comments for this item.

Log in to your account to post a comment.

2017 | The Technical University of Kenya Library | +254(020) 2219929, 3341639, 3343672 | library@tukenya.ac.ke | Haile Selassie Avenue