3471 search results - page 243 / 695 » Obstacle Numbers of Graphs |
284
Voted
ICITS
2011
14 years 9 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...
143
click to vote
APPROX
2009
Springer
16 years 22 days 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...
162
Voted
CEC
2008
IEEE
16 years 19 days 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...
172
click to vote
FUZZIEEE
2007
IEEE
16 years 14 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...
187
Voted
AB
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. In 1973 R. Thomas introduced a logical approach to modeling and analysis of bioregulatory networks. Given a set of Boolean functions describing the regulatory interaction...