4171 search results - page 58 / 835 » Choice numbers of graphs |
124
click to vote
CORR
2011
Springer
14 years 3 months ago
2011
Springer
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...
128
click to vote
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
119
click to vote
MP
2010
14 years 10 months ago
2010
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
101
click to vote
SIAMCOMP
2002
14 years 11 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
107
click to vote
ARSCOM
2002
14 years 11 months ago
2002
A graphical partition of the even integer n is a partition of n where each part of the partition is the degree of a vertex in a simple graph and the degree sum of the graph is n. ...