Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new characterizations. More intriguingly, these characterizations of chordal graphs can be naturally strengthened to new characterizations of strongly...

The Kneser graph K(m, n) has the n-subsets of {1, 2 . . . . . m} as its vertices, two such vertices being adjacent whenever they are disjoint. The kth multichromatic number of the graph G is the least integer t such that the vertices of G can be assigned k-subsets of {1, 2,... ,t}, so that adjacent vertices of G receive disjoint sets. The values of xk(K(m, n)) are computed for n = 2, 3 and boun...

This article reviews ten of the most important tabu search heuristics for the vehicle routing problem. Some of the main tabu search features are first described: neighbourhood structures, short term memory, long term memory, intensification. The tabu search algorithms are then described, followed by computational results and the conclusion.

IZA DP No. 11178 NOVEMBER 2017 Sorting out Neighbourhood Effects Using Sibling Data Previous research has reported evidence of intergenerational transmission of both neighbourhood status and social and economic outcomes later in life; parents influence where their children live as adults and how well they do later in life in terms of their income. However, interactions between the individual, t...

introductionhistoric cities and neighbourhoods in iran couldn’t adjust themselves to quick changes of the recent decades andhave lost their quality in many aspects. regardless of different cultural, economic and social conditions, newneighbourhoods have been formed next to old areas of the cities. although these new areas welcom ed newfunctions, they couldn’t provide suitable environments for t...

This paper describes a vision and 3D laser based registration approach which utilizes visual features to identify correspondences. Visual features are obtained from the images of a standard color camera and the depth of these features is determined by interpolating between the scanning points of a 3D laser range scanner, taking into consideration the visual information in the neighbourhood of t...

This paper presents techniques to address the complexity problem of subgraph isomorphism detection on large graphs. To overcome the inherently high computational complexity, the problem is simplified through the calculation and strengthening of topological node features. These features can be utilised, in principle, by any subgraph isomorphism algorithm. The design and capabilities of the propo...

This paper describes CRF-Matching, a recently proposed algorithm for data association of laser scans [19] that can be extended to handle many sensor modalities. CRF-Matching is a supervised probabilistic model able to jointly reason about the association of features. This is obtained by overcoming the independence assumption through the use of Conditional Random Fields (CRFs) [11]. CRFs are an ...

The aim of this paper is to develop a hybrid metaheuristic based on Variable Neighbourhood Search and Tabu Search for solving the Feature Subset Selection Problem in classification. Given a set of instances characterized by several features, the classification problem consists of assigning a class to each instance. Feature Subset Selection Problem selects a relevant subset of features from the ...