230 search results - page 8 / 46 » A Linear Time Algorithm for L(2, 1)-Labeling of Trees |
JDA
2007
13 years 7 months ago
2007
In the median problem, we are given a distance or dissimilarity measure d, three genomes G1, G2, and G3, and we want to find a genome G (a median) such that the sum 3 i=1 d(G, Gi...
SIAMSC
2008
13 years 7 months ago
2008
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
IPL
2010
13 years 6 months ago
2010
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...