779 search results - page 129 / 156 » A graph polynomial for independent sets of bipartite graphs |
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Given concentrations of metabolites over a sequence of time steps, the metabolic pathway prediction problem seeks a set of reactions and rate constants for them that could yield t...
114
click to vote
PODS
1994
ACM
15 years 1 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
172
click to vote
SPAA
2012
ACM
13 years 4 days ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...