Learn More
The most well-known theorem in combinatorial optimization is the classical max-flow min-cut theorem of Ford and Fulkerson. This theorem serves as the basis for deriving efficient algorithms for finding max-flows and min-cuts. Starting with the work of Leighton and Rao, significant effort was directed towards finding approximate analogs for the undirected(More)
Results of previous studies indicated that insulin at levels comparable to those in humans during hyperinsulinemia decreased ACTH-stimulated cortisol and androstenedione secretion by bovine adrenal fasciculata-reticularis cells in primary culture. In the present studies this inhibitory action was examined further by comparing the effects of insulin on(More)
  • N. Klein, Robert E. TarjanyAbstractWe
  • 1993
We present a randomized linear-time algorithm for nding a minimum spanning tree in a connected graph with edge weights. The algorithm is a modiication of one proposed by Karger and uses random sampling in combination with a recently discovered linear-time algorithm for verifying a minimum spanning tree. Our computational model is a unit-cost random-access(More)
We present a randomized linear-time algorithm for nding a minimum spanning tree in a connected graph with edge weights. The algorithm is a modiication of one proposed by Karger and uses random sampling in combination with a recently discovered linear-time algorithm for verifying a minimum spanning tree. Our computational model is a unit-cost random-access(More)
Secretion of pituitary gonadotropins is regulated centrally by the hypothalamic decapeptide gonadotropin releasing hormone (GnRH). Using the immortalized hypothalamic GT1-7 neuron, we characterized pharmacologically the dynamics of cytosolic Ca2+ and GnRH release in response to K+-induced depolarization of GT1-7 neurons. Our results showed that K+(More)
  • 1