2531 search results - page 59 / 507 » Group testing in graphs |
STACS
2010
Springer
14 years 5 months ago
2010
Springer
Testing whether there is an induced path in a graph spanning k given vertices is already NP-complete in general graphs when k = 3. We show how to solve this problem in polynomial t...
CORR
2008
Springer
13 years 11 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
IADIS
2004
14 years 4 days ago
2004
Many real world datasets are represented in the form of graphs. The classical graph properties found in the data, like cliques or independent sets, can reveal new interesting info...
ICDE
2009
IEEE
14 years 5 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
FOCS
2002
IEEE
14 years 3 months ago
2002
IEEE
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...