249 search results - page 40 / 50 » The upper bound on k-tuple domination numbers of graphs |
COMBINATORICS
1999
13 years 7 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
TCS
2010
13 years 5 months ago
2010
Cops and Robbers is a pursuit and evasion game played on graphs that has received much attention. We consider an extension of Cops and Robbers, distance k Cops and Robbers, where t...
SPAA
2005
ACM
14 years 28 days ago
2005
ACM
In 1995, Gremban, Miller, and Zagha introduced supporttree preconditioners and a parallel algorithm called supporttree conjugate gradient (STCG) for solving linear systems of the ...
GD
2005
Springer
14 years 27 days ago
2005
Springer
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
COMPGEOM
2010
ACM
14 years 13 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...