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.
Contributor(s): Bonato, Anthony [editor.]
| Janssen, Jeannette [editor.] | SpringerLink (Online service).
Material type: 
BookSeries: Theoretical Computer Science and General Issues: 7323Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2012Edition: 1st ed. 2012.Description: VIII, 179 p. 30 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642305412.Subject(s): Algorithms | Computer science -- Mathematics | Discrete mathematics | Application software | Data mining | Computer networks | Information storage and retrieval systems | Algorithms | Discrete Mathematics in Computer Science | Computer and Information Systems Applications | Data Mining and Knowledge Discovery | Computer Communication Networks | Information Storage and RetrievalAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 518.1 Online resources: Click here to access online
In:
Springer Nature eBookSummary: 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.
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.