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.
Material type:
TextSeries: Lecture Notes in Computer Science ; 7323Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2012Description: VIII, 179 p. 30 illus. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783642305412Subject(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 RetrievalAdditional physical formats: Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.9.A43Online 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.
E-BOOKS
| Current library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
| IMSc Library | IMSc Library | Link to resource | Available | EBK10243 |
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 on this title.