260 search results - page 32 / 52 » Resolution Complexity of Independent Sets in Random Graphs |
144
Voted
BMCBI
2006
15 years 3 months ago
2006
Background: After complete sequencing of a number of genomes the focus has now turned to proteomics. Advanced proteomics technologies such as two-hybrid assay, mass spectrometry e...
144
click to vote
ECAI
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. The emergence of complex network structures of relationships between autonomous agents occurs in a wide range of distributed systems. Many researchers have proposed model...
116
click to vote
DAM
2008
15 years 3 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
157
click to vote
COCO
1994
Springer
15 years 7 months ago
1994
Springer
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
149
Voted
APPROX
2011
Springer
14 years 3 months ago
2011
Springer
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...