1434 search results - page 25 / 287 » Graph Searching with Advice |
169
Voted
SPIRE
2005
Springer
15 years 9 months ago
2005
Springer
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
127
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We study the problem of local search on a graph. Given a real-valued black-box function f on the graph's vertices, this is the problem of determining a local minimum of f--a v...
112
click to vote
ADBIS
2006
Springer
15 years 9 months ago
2006
Springer
The Web is a typical example of a social network. One of the most intriguing features of the Web is its self-organization behavior, which is usually faced through the existence of ...
142
click to vote
CONSTRAINTS
2007
15 years 3 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
119
Voted
MFCS
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We introduce nondeterministic graph searching with a controlled amount of nondeterminism and show how this new tool can be used in algorithm design and combinatorial anal...