4171 search results - page 84 / 835 » Choice numbers of graphs |
188
click to vote
COLOGNETWENTE
2010
15 years 3 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...
158
click to vote
DM
2000
15 years 6 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
195
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Clustering the information content of large high-dimensional gene expression datasets has widespread application in "omics" biology. Unfortunately, the under...
183
click to vote
CRYPTO
2001
Springer
15 years 11 months 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...
176
click to vote
COMBINATORICS
2006
15 years 6 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, . . ....