2531 search results - page 203 / 507 » Group testing in graphs |
168
click to vote
FOCS
2008
IEEE
16 years 27 days ago
2008
IEEE
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
199
click to vote
AGTIVE
2003
Springer
15 years 11 months ago
2003
Springer
Graph-reduction specifications (GRSs) are a powerful new method for specifying classes of pointer data structures (shapes). They cover important shapes, like various forms of bal...
209
click to vote
BIOINFORMATICS
2008
15 years 6 months ago
2008
Motivation: Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between...
153
click to vote
DAM
2007
15 years 6 months ago
2007
This work describes a study on the generation of bicliques of a graph. We show that it is NP-complete to test whether a subset of the vertices of a graph is part of a biclique. We ...
164
click to vote
EC
2007
15 years 6 months ago
2007
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly r...