238 search results - page 26 / 48 » Parallel Algorithm for Maximum Weight Matching in Trees |
ICPPW
2003
IEEE
15 years 2 months ago
2003
IEEE
Gaussian Cubes (GCs) are a family of interconnection topologies in which the interconnection density and algorithmic efficiency are linked by a common parameter, the variation of ...
104
click to vote
ALGORITHMICA
1998
14 years 9 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
A star graph is a tree of diameter at most two. A star forest is a graph that consists of node-disjoint star graphs. In the spanning star forest problem, given an unweighted graph ...
68
Voted
IPPS
2007
IEEE
15 years 3 months ago
2007
IEEE
Bayesian phylogenetic inference is an important alternative to maximum likelihood-based phylogenetic method. However, inferring large trees using the Bayesian approach is computat...
PODS
2008
ACM
15 years 9 months ago
2008
ACM
In this study we propose sketching algorithms for computing similarities between hierarchical data. Specifically, we look at data objects that are represented using leaf-labeled t...