3211 search results - page 531 / 643 » On the Grundy Number of a Graph |
BMCBI
2008
13 years 9 months ago
2008
Background: Much effort is currently made to develop the Gene Ontology (GO). Due to the dynamic nature of information it addresses, GO undergoes constant updates whose results are...
CGF
2010
13 years 9 months ago
2010
We present a novel image-based technique for modeling complex unfoliaged trees. Existing tree modeling tools either require capturing a large number of views for dense 3D reconstr...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
We study the problem of maximizing the broadcast rate in peer-to-peer (P2P) systems under node degree bounds, i.e., the number of neighbors a node can simultaneously connect to is ...
DAM
2008
13 years 9 months ago
2008
For digraphs D and H, a mapping f : V (D)V (H) is a homomorphism of D to H if uv A(D) implies f(u)f(v) A(H). For a fixed directed or undirected graph H and an input graph D, the...
BMCBI
2006
13 years 9 months ago
2006
Background: Gene Ontology (GO) terms are often used to assess the results of microarray experiments. The most common way to do this is to perform Fisher's exact tests to find...