1729 search results - page 21 / 346 » On Bounds for the k-Partitioning of Graphs |
SIAMDM
2008
14 years 9 months ago
2008
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
102
click to vote
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
We consider the problem of testing 3-colorability in the bounded-degree model. We show that, for small enough ε, every tester for 3colorability must have query complexity Ω(n)....
JAIR
2010
14 years 8 months ago
2010
The paper investigates parameterized approximate message-passing schemes that are based on bounded inference and are inspired by Pearl’s belief propagation algorithm (BP). We st...
ENDM
2002
14 years 9 months ago
2002
It is well-known that the maximal size of minimally 3-connected graphs of order 7n is 93 -n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, ...
101
click to vote
COLOGNETWENTE
2010
14 years 8 months ago
2010
We present an algorithm for the independent set problem on semi-random graphs, which are generated as follows: An adversary chooses an n-vertex graph, and then each edge is flipp...