We consider random walks on two classes of random graphs and explore the likely structure of the vacant set viz. the set of unvisited vertices. Let (t) be the subgraph induced by ...
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
Pier Francesco Cortese, Giuseppe Di Battista, Maur...
An important milestone in the evolution of the Web is the Semantic Web: a Web in which the semantics of the available content and functionality is made explicit. Web design methods...
We consider how to use external memory, such as disk storage, to improve the scalability of heuristic search in statespace graphs. To limit the number of slow disk I/O operations,...
We initiate the study of graph sketching, i.e., algorithms that use a limited number of linear measurements of a graph to determine the properties of the graph. While a graph on n...