3211 search results - page 70 / 643 » On the Grundy Number of a Graph |
DM
2000
13 years 7 months ago
2000
Let G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classes of Djokovi
BMCBI
2010
13 years 8 months ago
2010
Background: Clustering the information content of large high-dimensional gene expression datasets has widespread application in "omics" biology. Unfortunately, the under...
CRYPTO
2001
Springer
14 years 9 days ago
2001
Springer
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
ICITS
2011
12 years 11 months ago
2011
In this paper, we use the concept of colored edge graphs to model homogeneous faults in networks. We then use this model to study the minimum connectivity (and design) requirements...
COMBINATORICS
2006
13 years 7 months ago
2006
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....