Computing a spanning tree and the connected components of a graph are basic problems in Graph Theory and arise as subproblems in many applications. Dehne et al. present a BSP/CGM a...
The New Zealand Digital Library offers several collections of information over the World Wide Web. Although fulltext indexing is the primary access mechanism, musical collections ...
Abstract— The current approach in web searching, i.e., centralized search engines, rises issues that question their future applicability: 1) coverage and scalability, 2) freshnes...
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
Combinatorial optimization problems require computing efforts which grow at least exponentially with the problem dimension. Therefore, the use of the remarkable power of massively...
Ivan De Falco, Renato Del Balio, Ernesto Tarantino...