674 search results - page 1 / 135 » The computational complexity of the parallel knock-out probl... |
JCB
2008
13 years 11 months ago
2008
Given a metabolic network in terms of its metabolites and reactions, our goal is to efficiently compute the minimal knock out sets of reactions required to block a given behaviour....
DAM
2007
13 years 11 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
WAIM
2010
Springer
13 years 9 months ago
2010
Springer
SimRank has been considered as one of the promising link-based ranking algorithms to evaluate similarities of web documents in many modern search engines. In this paper, we investi...
TCS
2008
13 years 11 months ago
2008
We consider computational complexity questions related to parallel knock-out schemes for graphs. In such schemes, in each round, each remaining vertex of a given graph eliminates ...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM