2531 search results - page 52 / 507 » Group testing in graphs |
ARSCOM
2006
13 years 10 months ago
2006
We show that permutation decoding can be used, and give explicit PD-sets in the symmetric group, for some of the binary codes obtained from the adjacency matrices of the graphs on...
ICALP
2010
Springer
14 years 2 months ago
2010
Springer
We present an O(m + n)-time algorithm that tests if a given directed graph is 2-vertex connected, where m is the number of arcs and n is the number of vertices. Based on this resul...
BMCBI
2008
13 years 11 months ago
2008
Background: Microarray analysis is an important area of bioinformatics. In the last few years, biclustering has become one of the most popular methods for classifying data from mi...
ASM
2005
ASM
14 years 4 months ago
2005
ASM
Abstract. Exploration algorithms are relevant to the industrial practice of gentest cases from an abstract state machine whose runs define the predicted behavior of the software s...
ALGORITHMICA
2010
13 years 11 months ago
2010
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...