2531 search results - page 126 / 507 » Group testing in graphs |
128
click to vote
STACS
2001
Springer
15 years 5 months ago
2001
Springer
We prove new results on evasiveness of monotone graph properties by extending the techniques of Kahn, Saks, and Sturtevant [Combinatorica, 4 (1984), pp. 297–306]. For the propert...
98
Voted
CSR
2008
Springer
15 years 2 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...
94
Voted
DATE
2008
IEEE
15 years 7 months ago
2008
IEEE
– A new approach for diagnostic analysis of static errors in multi-step ADC based on the steepestdescent method is proposed. To set initial data, estimate the parameter update an...
GECCO
2006
Springer
15 years 4 months ago
2006
Springer
We propose a new crossover that generalizes cycle crossover to permutations with repetitions and naturally suits partition problems. We tested it on graph partitioning problems ob...
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...