Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant (2009)
W. Goddard, S. T. Hedetniemi, D. P. Jacobs, Pradip K. Srimani
Abstract. We propose a generalized scheme that can convert any algorithm that self-stabilizes under an unfair central daemon into a randomized one that self-stabilizes under a distributed daemon,...
Minimal and Maximal e=1 Functions (2008)
P. Dankelmann, D. J. Erwin, G. Fricke, W. Goddard, H. C. Swart
Dedicated to Ernie Cockayne, friend and colleague Abstract. An e = 1 function is a function f: V (G) ↦ → [0, 1] such that every non-isolated vertex u is adjacent to some vertex v such that f(u) +...
Bicritical Geodomination, D. A. Mojdeh, R. C. Brigham, T. W. Haynes, M. A. Henning, D. F. Rall, ...
A geodominating set in a graph G is a set S such that any vertex v ∈ V (G)\S is geodominated by at least one pair of vertices of S. A k geodominating set is a geodominating set S such that any...
MAD trees and distance-hereditary graphs (2008)
E. Dahlhaus, P. Dankelmann, W. Goddard
For a graph G with weight function w on the vertices, the total distance of G is the sum over all unordered pairs of vertices x and y of w(x)w(y) times the distance between x and y. A MAD tree of G...
Hyperpolarizabilities of Push-Pull Polyenes: Experimental Results and a New Two-State Model (2004)
Perry, J., Bourhill, G., Marder, S., Lu, D., Chen, G., Goddard, W.
Recent work has demonstrated a correlation between the geometry (i.e., the bond length alteration, BLA) and the first and second hyperpolarizabilities (betta and gamma) of donor-acceptor substituted...
A synchronous self-stabilizing minimal domination protocol in an arbitrary network graph (2003)
Z. Xu, S. T. Hedetniemi, W. Goddard, P. K. Srimani
Abstract. In this paper we propose a new self-stabilizing distributed algorithm for minimal domination protocol in an arbitrary network graph using the synchronous model; the proposed protocol is...
Damping Materials, Finite Elements and Special Projects. (1998)
Ruddell,M., Graf,P. A., Kluesener,M. F., Hopkins,D. M., Goddard,W.
This report denotes work under the subject contract in the area of polymeric and enamel material damping properties measurement, finite element analysis of damped components and some special...
Cowen Goddard, L. J. Cowen, W. Goddard, C. E. Jesurum
An (ordinary vertex) coloring is a partition of the vertices of a graph into independent sets. The chromatic number is the minimum number of colors needed to produce such a partition. This paper...
Defective Coloring Revisited (1995)
L.J. Cowen, W. Goddard, C.E. Jesurum
A graph is (k; d)-colorable if one can color the vertices with k colors such that no vertex is adjacent to more than d vertices of the same color. In this paper we investigate the existence of such...
Herbal creams used for atopic eczema in Birmingham, UK illegally contain potent corticosteroids
Ramsay, H, Goddard, W, Gill, S, Moss, C
Aims: To determine whether "herbal creams" reported as being effective for the treatment of childhood atopic eczema contained corticosteroids.