3008 search results - page 201 / 602 » Independence in connected graphs |
147
click to vote
ENDM
2007
15 years 6 months ago
2007
For a graph G and an integer t we let mcct(G) be the smallest m such that there exists a coloring of the vertices of G by t colors with no monochromatic connected subgraph having ...
169
click to vote
IWQOS
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. Previous work have assumed an independent model for overlay networks: a graph with independent link capacities. We introduce a model of overlays (LCC-overlay) which incor...
155
click to vote
ISIPTA
2003
IEEE
15 years 12 months ago
2003
IEEE
Independence models induced by some uncertainty measures (e.g. conditional probability, possibility) do not obey the usual graphoid properties, since they do not satisfy the symme...
146
click to vote
IPPS
2007
IEEE
16 years 27 days ago
2007
IEEE
In message-passing parallel applications, messages are not delivered in a strict order. In most applications, the computation results and the set of messages produced during the e...
166
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
What is the maximum possible number, f3(n), of vectors of length n over {0, 1, 2} such that the Hamming distance between every two is even? What is the maximum possible number, g3...