The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
We present a systematic study of approximation algorithms for the maximum weight matching problem. This includes a new algorithm which provides the simple greedy method with a rece...
How to determine the number of clusters is an intractable problem in clustering analysis. In this paper, we propose a new learning paradigm named Maximum Weighted Likelihood (MwL)...
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
Rajiv Gandhi, Bradford Greening, Sriram V. Pemmara...