4171 search results - page 208 / 835 » Choice numbers of graphs |
153
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...
139
click to vote
ICDT
2007
ACM
16 years 24 days ago
2007
ACM
We consider random graphs, and their extensions to random structures, with edge probabilities of the form βn−α , where n is the number of vertices, α, β are fixed and α >...
163
click to vote
GD
2004
Springer
16 years 1 days ago
2004
Springer
We present an O(n) time algorithm for simultaneous embedding of pairs of planar graphs on the O(n2 )×O(n2 ) grid, with at most three bends per edge, where n is the number of verti...
153
click to vote
EVOW
2006
Springer
15 years 10 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
178
click to vote
AAIM
2010
Springer
15 years 10 months ago
2010
Springer
We present a polynomial-time approximation algorithm for legally coloring as many edges of a given simple graph as possible using two colors. It achieves an approximation ratio of...