In this paper, we aim at showing the advantages of Conceptual Graph formalism for the Semantic Web through several real-world applications in the framework of Corporate Semantic We...
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is as...
Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M...
In the case where the search space has a group structure, classical genetic operators (mutation and two-parent crossover) which respect the group action are completely characterize...
Jonathan E. Rowe, Michael D. Vose, Alden H. Wright
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
We consider the problem of finding obnoxious centers in graphs. For arbitrary graphs with n vertices and m edges, we give a randomized algorithm with O(n log2 n + m log n) expecte...