Special Issue on Algorithms and Models for the Web Graph

Abstract

The 8th Workshop on Algorithms and Models for the Web Graph (WAW 2011) took place at Emory University in Atlanta, Georgia, May 27–29, 2011. This is an annual meeting, which is traditionally co-located with another, related, conference. WAW 2011 was co-located with the 15th International Conference on Random Structures and Algorithms (RSA 2011). Co-location of the workshop and conference provided opportunities for researchers in two different but interrelated areas to interact and to exchange research ideas. It was an effective venue for the dissemination of new results and for fostering research collaboration. The World Wide Web has become part of our everyday life, and information retrieval and data mining on the Web are now of enormous practical interest. The algorithms supporting these activities combine the view of the Web as a text repository and as a graph, induced in various ways by links among pages, hosts, and users. 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 to stimulate the development of high-performance algorithms and applications that exploit these graphs. The workshop gathered researchers who are working on graph-theoretic and algorithmic aspects of related complex networks, including citation networks, social networks, biological networks, molecular networks, and other networks arising from the Internet. This issue of Internet Mathematics includes a selection of papers that were presented at the workshop. The papers in this issue, unlike the conference proceedings of the workshop, do not have page limits and contain full versions of