230 search results - page 6 / 46 » A Linear Time Algorithm for L(2, 1)-Labeling of Trees |
COMPGEOM
1993
ACM
13 years 11 months ago
1993
ACM
For a polygon P, the bounded Voronoi diagram of P is a partition of P into regions assigned to the vertices of P. A point p inside P belongs to the region of a vertex v if and onl...
SPIRE
2004
Springer
14 years 1 months ago
2004
Springer
Given a set of strings U = {T1, T2, . . . , T }, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of U. We als...
DGCI
2009
Springer
13 years 11 months ago
2009
Springer
For discrete sets coded by the Freeman chain describing their contour, several linear algorithms have been designed for determining their shape properties. Most of them are based ...
CATS
2007
13 years 9 months ago
2007
Financial derivatives are contracts concerning rights and obligations to engage in future transactions on some underlying financial instrument. A major concern in financial mark...
BMCBI
2010
13 years 7 months ago
2010
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...