This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
— Invasive Weed Optimization Algorithm IWO) is an ecologically inspired metaheuristic that mimics the process of weeds colonization and distribution and is capable of solving mul...
The paper presents an evaluation of four clustering algorithms: k-means, average linkage, complete linkage, and Ward’s method, with the latter three being different hierarchical...
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
Vicky Choi, Chunfang Zheng, Qian Zhu, David Sankof...