2698 search results - page 186 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
124
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract. In this paper, we consider parallelizability of some Pcomplete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We pr...
366
click to vote
AAIM
2011
Springer
14 years 10 months ago
2011
Springer
A star forest is a collection of vertex-disjoint trees of depth at most 1, and its size is the number of leaves in all its components. A spanning star forest of a given graph G is ...
153
click to vote
IJCAI
2003
15 years 7 months ago
2003
We address the task of problem determination in a distributed system using probes, or test transactions, which gather information about system components. Effective probing requir...
236
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Detecting groups of functionally related proteins from their amino acid sequence alone has been a long-standing challenge in computational genome research. Several clu...
149
click to vote
SAC
2009
ACM
16 years 1 months ago
2009
ACM
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...