715 search results - page 25 / 143 » On graphs with subgraphs having large independence numbers |
ARC
2007
Springer
13 years 11 months ago
2007
Springer
Many important algorithms in computational biology and related subjects rely on the ability to extract and to identify sub-graphs of larger graphs; an example is to find common fun...
SGAI
2004
Springer
14 years 26 days ago
2004
Springer
The assessment of a probability distribution associated with a Bayesian network is a challenging task, even if its topology is sparse. Special probability distributions based on t...
ARITH
2005
IEEE
14 years 1 months ago
2005
IEEE
We present a radix-2 online computational scheme for evaluating multinomials in a fixed-point number representation system. Its main advantage is that it can adapt to any evaluat...
JGT
2006
13 years 7 months ago
2006
Jeager et al introduced a concept of group connectivity as an generalization of nowhere zero flows and its dual concept group coloring, and conjectured that every 5-edge connected...
CGF
1999
13 years 7 months ago
1999
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...