3204 search results - page 19 / 641 » The Alcuin Number of a Graph |
MP
2010
13 years 6 months ago
2010
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
SIAMCOMP
2002
13 years 7 months ago
2002
A set of vertices in a graph is a dominating set if every vertex outside the set has a neighbor in the set. The domatic number problem is that of partitioning the vertices of a gra...
CDC
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper we examine the leader-to-follower ratio needed to maintain connectivity in a leader-follower multiagent network with proximity based communication topology. In th...
IWPEC
2004
Springer
14 years 1 months ago
2004
Springer
Let G = V; E be a graph. The linear-width of G is de ned as the smallest integer k such that E can be arranged in a linear ordering e1; : : : ; er such that for every i = 1; :...
COMPSYSTECH
2011
12 years 7 months ago
2011
Abstract. In a software watermarking environment, several graph theoretic watermark methods encode the watermark values as graph structures and embed them in application programs. ...