17 search results - page 4 / 4 » Solving a 2D Knapsack Problem on an Associative Computer Aug... |
STACS
2007
Springer
13 years 12 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
BMCBI
2010
13 years 5 months ago
2010
Background: High-throughput methods for detecting protein-protein interactions enable us to obtain large interaction networks, and also allow us to computationally identify the as...