1434 search results - page 19 / 287 » Graph Searching with Advice |
113
Voted
ICCS
2005
Springer
15 years 9 months ago
2005
Springer
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...
143
Voted
WG
1994
Springer
15 years 7 months ago
1994
Springer
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...
116
Voted
FOGA
2007
15 years 4 months ago
2007
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...
108
Voted
LCN
2007
IEEE
15 years 9 months ago
2007
IEEE
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...
137
Voted
SIAMDM
2010
14 years 10 months ago
2010
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...