A central cycle problem requires a cycle that is reasonably short and keeps a the maximum distance from any node not on the cycle to its nearest node on the cycle reasonably low. The objective may be to minimise maximum distance or cycle length and the solution may have further constraints. Most classes of central cycle problems are NP-hard. This paper investigates insertion heuristics for cent...

Baire category techniques are known to be a powerful tool in the investigation of the convex sets. Their use, which goes back to the fundamental contribution of Klee [17], has permitted to discover several interesting unexpected properties of convex sets (see Gruber [14], Schneider [23], Zamfirescu [25]). A survey of this area of research and additional bibliography can be found in [15, 27]. In...

William Hamilton argued that even species inhabiting the farthest flung corners of the universe should age. However, a recent study shows that to find a species that escapes ageing, you only need to look as far as your local pond.

It is shown that matrices over algebraically closed fields that are farthest apart in the commuting graph must be non-derogatory. Rank-one matrices and diagonalizable matrices are also characterized in terms of the commuting graph.

It is shown that matrices over algebraically closed fields that are farthest apart in the commuting graph must be non-derogatory. Rank-one matrices and diagonalizable matrices are also characterized in terms of the commuting graph.

background and aims. palatal masticatory mucosa serves as donor material in periodontal plastic surgery. this study determined the palatal mucosal thickness in indian subjects aged 14−59 years by direct bone sounding and its association with gender and age. materials and methods. this observational study was conducted on 40 dentate systemically and periodontally healthy indians (age range of 14...

the wiener index w(g) of a connected graph g is defined as the sum of the distances betweenall unordered pairs of vertices of g. the eccentricity of a vertex v in g is the distance to avertex farthest from v. in this paper we obtain the wiener index of a graph in terms ofeccentricities. further we extend these results to the self-centered graphs.

Clustering is the process of grouping of data, where the grouping is established by finding similarities between data based on their characteristics. Such groups are termed as Clusters. A comparative study of clustering algorithms across two different data items is performed here. The performance of the various clustering algorithms is compared based on the time taken to form the estimated clus...

In an earlier paper, we briefly presented a new halftoning algorithm called farthest-point halftoning. In the present paper, this method is analyzed in detail, and a novel dispersion measure is defined to improve the simplicity and flexibility of the result. This new stochastic screen algorithm is loosely based on Kang’s dispersed-dot ordered dither halftone array construction technique used as...