3663 search results - page 76 / 733 » Problems in the ontology of computer programs |
ICALP
2000
Springer
14 years 10 days ago
2000
Springer
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...
ERSHOV
2009
Springer
14 years 19 days ago
2009
Springer
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...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
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...
IFIP
1994
Springer
14 years 25 days ago
1994
Springer
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 ...
SBACPAD
2004
IEEE
13 years 10 months ago
2004
IEEE
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...