394 search results - page 40 / 79 » Testing subgraphs in large graphs |
STOC
2004
ACM
14 years 9 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
COMBINATORICA
2010
13 years 6 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
ICALP
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. We propose the study of graphs that are defined by lowcomplexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of in...
SEMWEB
2009
Springer
14 years 1 months ago
2009
Springer
RDF is an increasingly important paradigm for the representation of information on the Web. As RDF databases increase in size to approach tens of millions of triples, and as sophis...
BMCBI
2008
13 years 9 months ago
2008
Background: In current comparative proteomics studies, the large number of images generated by 2D gels is currently compared using spot matching algorithms. Unfortunately, differe...