We give an O(n log n) algorithm for computing the girth (shortest cycle) of an undirected n-vertex planar graph. Our solution extends to any graph of bounded genus. This improves u...
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
Peter E. Bulychev, Egor V. Kostylev, Vladimir A. Z...
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
The aim of this discussion paper is to stimulate (or perhaps to provoke) stronger interactions among theoreticians and practitioners interested in efficient problem solutions. We ...
Large scale cluster, Peer-to-Peer computing systems and grid computer systems gather thousands of nodes for computing parallel applications. At this scale, it raises the problem o...