In this paper, we address the approximate nearest neighbor (ANN) search problem over large scale visual descriptors. We investigate a simple but very effective approach, neighborhood graph (NG) search, which conducts the local search by expanding neighborhoods with a best-first manner. Expanding neighborhood makes it efficient to locate the descriptors with high probability being true NNs. Howe...

Voronoi diagrams are a classical tool for analyzing spatial neighborhood relations. For point elds the spatial proximity can be easily visualized by the dual graph, the Delaunay triangulation. In image analysis VDs and DTs are commonly used to derive neighborhoods for grouping or for relational matching. Neighborhood relations derived from the VD, however, are uncertain in case the common side ...

In this paper, we study the conflict-free coloring of graphs induced by neighborhoods. A coloring of a graph is conflict-free if every vertex has a uniquely colored vertex in its neighborhood. The conflict-free coloring problem is to color the vertices of a graph using the minimum number of colors such that the coloring is conflict-free. We consider both closed neighborhoods, where the neighbor...

Given an undirected graph with weights associated with its edges, the degree-constrained minimum spanning tree problem consists in nding a minimum spanning tree of the given graph, subject to constraints on node degrees. We propose a variable neighborhood search heuristic for the degree-constrained minimum spanning tree problem, based on a dynamic neighborhood model and using a variable neighbo...

Let be a non-trivial simple graph. A dominating set in graph is of vertices such that every vertex not the adjacent to at least one set. subset minimum neighborhood if and for holds. The cardinality called as number it denoted by . where intersection neighborhoods all small possible, (i.e., ). number, , In other words, smallest needed form neighborhood-dominating concept related study structure...