3211 search results - page 224 / 643 » On the Grundy Number of a Graph |
197
click to vote
XSYM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We propose a mapping from the Enhanced Entity Relationship conceptual model to the W3C XML Schema Language with the following properties: information and integrity constr...
175
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
The study of complex networks led to the belief that the connectivity of network nodes generally follows a Power-law distribution. In this work, we show that modeling large-scale ...
155
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
The r-parity tensor of a graph is a generalization of the adjacency matrix, where the tensor’s entries denote the parity of the number of edges in subgraphs induced by r distinc...
167
click to vote
CEC
2008
IEEE
16 years 1 months ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
177
click to vote
FUZZIEEE
2007
IEEE
16 years 26 days ago
2007
IEEE
—Approaches based on conditional independence tests are among the most popular methods for learning graphical models from data. Due to the predominance of Bayesian networks in th...