Let G = (V, E) be a graph and let W:V→N be a non-negative integer weighting of the vertices in V. A nonempty set of vertices S ⊆ V is called a weighted defensive alliance if ∀v ∈ S ,∑u∈N[v]∩S w(u) ≥ ∑x∈N(v)−S w(x). A non-empty set S ⊆ V is a weighted offensive alliance if ∀v ∈ δS ,∑u∈N(v)∩S w(u) ≥ ∑x∈N[v]−S w(x). A weighted alliance which is both defensive and offensive is called a weighted pow...

1 and Midazolam in Healthy Adult Subjects 2 3 4 5 Helen Winter 6 Erica Egizi 7 Ngozi Erondu 8 Ann Ginsberg 9 Doris J. Rouse 10 Diana Severynse-Stevens 11 Elliott Pauli 12 Daniel Everitt 13 14 15 16 17 1 School of Pharmacy, University of Otago, PO Box 56, Dunedin 9045, New Zealand 18 2 Global Alliance for TB Drug Development, 40 Wall Street, 24 Floor, New York, NY 19 10005, USA 20 3 RTI Internat...