The purpose of this paper is to deal with some uniqueness problems of entire functions or meromorphic functions concerning differential polynomials that share one value or fixedpoints with finite weight. We obtain a number of theorems which generalize some results due to M.L. Fang & X.H. Hua, X.Y. Zhang & W.C. Lin, X.Y. Zhang & J.F. Chen and W.C. Lin.

We present and investigate a new method for the Traveling Salesman Problem (TSP) that incorporates backbone information into the well known and widely applied Lin-Kernighan (LK) local search family of algorithms for the problem. We consider how heuristic backbone information can be obtained and develop methods to make biased local perturbations in the LK algorithm and its variants by exploiting...

We present a local improvement heuristic for genetic algorithms, and term it a Kernighan-Lin style heuristic. We analyze the runtime cost of the heuristic, and show that it can be affordable. We then demonstrate through experiments that the heuristic provides very quick solutions to several problems which have been touted in the literature as especially hard ones for genetic algorithms. We sugg...

A parallel algorithm to recognize cographs with a linear processor bound and a log’ II time bound is presented. This result extends the result of Adhar and Peng (1990). Moreover, we get a better time processor product than the algorithm of Lin and Olariu (199 I ). As a consequence distance hereditary graphs can be recognized by the same processor and time bound.

Graph partitioning requires the division of a graph's vertex set into k equally sized subsets s. t. some objective function is optimized. High-quality partitions are important for many applications, whose objective functions are often NP-hard to optimize. Most state-of-the-art graph partitioning libraries use a variant of the Kernighan-Lin (KL) heuristic within a multilevel framework. While the...