Cynthia A. Phillips
- 1.A. Aggarwal and M. M. Klawe, "Applications of generalized matrix searching to geometric algorithms", Dzscrete Applied Mathematics, 27(1,2):3- 23, May, 1990. Google Scholar
Digital Library
- 2.A. Aggarwal, M. M. Klawe, S. Moran, P. Shor, and R. Wilber, "Geometric applications of a matrixsearching algorithm", Algorithmica, 2(2):195-208, 1987.Google ScholarDigital Library
- 3.A. Aggarwal and J. K. Park, "Improved Algorithms for Economic Lot-Size Problems", Oper. Res., to appear, (Report RC 15626, IBM T. J. Watson Research Center, Yorktown Heights, NY, 1990). Google ScholarDigital Library
- 4.M. O. Ball and j. S. Provan, "Calculating bounds on teachability and connectedness in stochastic networks", Networks, 13:253-278, 1983.Google ScholarCross Ref
- 5.D. Bienstock, "Some generalized max-flow rain-cut problems in the plane," Mathematics of Operations Research, 16(2):310-333, May 1991. Google ScholarDigital Library
- 6.P. Z. Chinn, :I. Chv~talov~, A. K. Dewdney, N.E. Gibbs, "The bandwidth problem for graphs and matrices a survey", J. Graph Theory, Vol. 6, 1982, pp. 223-254.Google ScholarCross Ref
- 7.J. Chv~talov~, A. K. Dewdney, N. E. Gibbs, R. R. Korfhage, "The bandwidth problem for graphs: a collection of recent results", Res. report #24, Dept. of Comput. Sci., UWO, London, Ont, 1975.Google Scholar
- 8.:I. Cheriyan, T. Hagerup, and K. Mehlhorn, "Can a maximum flow be computed in o(mn) time?", Proceedings of ICALP, 1990. Google ScholarDigital Library
- 9.W. Cunningham, "Optimal attack and reinforcement of a network", JACM, 32(3):549-561, July 1985. Google ScholarDigital Library
- 10.L. R. Ford Jr. and D. R. Fulkerson, Flows in Networks, Princeton Univ. Press, Princeton, Nil, 1962.Google ScholarCross Ref
- 11.G. Fredrickson, "Fast algorithms for shortest paths in planar graphs, with applications", SIAM J. Comput., 16(6):1004-1022, Dec. 1987. Google ScholarDigital Library
- 12.G. Fredrickson, "Planar graph decomposition and all pairs shortest paths", JACM, 38(1):162-204, 1991. Google ScholarDigital Library
- 13.G. Oallo, M. D. Grigoriadis, and R. E. Tarjan, "A fast parametric maximum flow algorithm and applications," SIAM J. Comput. 18(1):30-55, Feb. 1989. Google ScholarDigital Library
- 14.M. R. Garey, D. S. Johnson, and L. Stockmeyer, "Some simplified NP-complete graph problems", Theoretical Computer Science, 1:237-267, 1976.Google Scholar
- 15.M. 1%. Garey, and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP- Completeness, W. H. Freeman and Company, NY, 1979. Google ScholarDigital Library
- 16.A. Goldberg, R. Tarjan, "A new approach to the maximumflow problem", JA CM, 35:921-940, 1988. Google ScholarDigital Library
- 17.O. Goldschmidt and D. Hochbaum, "Polynomial algorithm for the k-cut problem", Proc. 29th FOCS, 1988, pp. 444-451.Google ScholarDigital Library
- 18.D. Gusfield, "Computing the strength of a graph," SIAM J. Comput., 20(4):639-654, Aug. 1991. Google ScholarDigital Library
- 19.F. Hadlock, "Finding a maximum cut of a planar graph in polynomial time", SIAM J. Comput., 4(3):221-225, Sept. 1975.Google ScholarDigital Library
- 20.P. L. Hammer, R. Maffray, and M. Queyranne, "Cut-threshold graphs", Dzscrete Applied Ma~hematzcs, 30:163-179, 1991. Google ScholarDigital Library
- 21.F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1972.Google Scholar
- 22.R. Hassin, "Approximation schemes for the restricted shortest path problem", Malh. Oper. Res., 17(1):36-42, Feb. 1992. Google ScholarDigital Library
- 23.R. Hassin and D. Johnson, "An O(nlog2 n) algorithm for maximum flow in undirected planar networks", SIAM J. Comput., 14(3):612-624, Aug. 1985.Google ScholarDigital Library
- 24.A. Itai and Y. Shiloach, "Maximum flow in planar networks", SIAM J. Compute., 8(2):135-150, 1979.Google ScholarDigital Library
- 25.D. Johnson, "The NP-completeness column: an ongoing guide (16th)", J. Alg., 6(3):434-451, 1985.Google ScholarCross Ref
- 26.H. C. :Ioksch, "The shortest route problem with Constraints", J. Math. Anal. Appl., 14:191-197, 1966.Google ScholarCross Ref
- 27.R. Karp, "Reducibility among combinatorial problems", in Complexzty of Computer Computaiions, R. E. Miller and J. W. Thatcher eds., Plenum Press, NY, 1972, pp. 85-103.Google Scholar
- 28.V. King, S. Rao, and R. Tarjan, "A faster deterministic maximum flow algorithm", Proc. 3rd ACM- SIAM SODA, 1992, pp. 157-164. Google ScholarDigital Library
- 29.M. M. Klawe and D. J. Kleitman, "An almost linear time algorithm for generalized matrix searching" SIAM J. Disc. Math., 3(1):81-97, Feb. 1990. Google ScholarDigital Library
- 30.P.N. Klein, A. Agrawal, R. Ravi, and S. Rao, "Approximation through multicommodity flow," Proc. 31s# Annual FOCS, 1990, pp. 726-737.Google Scholar
- 31.E. L. Lawler, Combinatorial Optimizalzon: Networks and Matroids, Holt, Rinehart, and Winston, New York, 1976.Google Scholar
- 32.E. Minieka, "Maximal, lexicographic, and dynamic network flows", Oper. _Res., 21(2):517-527, 1973.Google ScholarDigital Library
- 33.J. K. Park and C. A. Phillips, manuscript in preparation.Google Scholar
- 34.C. H. Papadimitriou and K. Steiglitz, Combzna- ~omal Optim,zation: Algomthms and Complezzty, Prentice-Hall, Inc, Englewood Cliffs, Nil, 1982. Google ScholarDigital Library
- 35.C. A. Phillips, manuscript in preparation.Google Scholar
- 36.F. Preparata and M. Shamos, Computational Geometry: An Introduction, Springer-Verlag, NY, 1985. Google ScholarDigital Library
- 37.J. S. Provan and M. O. Ball, "The complexity of counting cuts and of computing the probability that a graph is connected", SIAM J. Compul., 12(4):777-788, Nov. 1983.Google ScholarDigital Library
- 38.J. Reif, "Minimum s-t cut of a planar undirected network in O(nlog2(n)) time", SIAM J. Comput., 12(1):71-81, Feb. 1983.Google ScholarDigital Library
- 39.I#va Tardos, priviate communication.Google Scholar
- 40.S. Tsukiyama, I. Shirakawa, and H. Ozaki, "An algorithm to enumerate all cutsets of a graph in linear time per cutset", JA CM, 27(4):619-632, Oct. 1980. Google ScholarDigital Library
Index Terms
- The network inhibition problem
Recommendations
Tonically balancing intracortical excitation and inhibition by gabaergic gliotransmission
For sensory cortices to respond reliably to feature stimuli, the balancing of neuronal excitation and inhibition is crucial. A typical example might be the balancing of phasic excitation within cell assemblies and phasic inhibition between cell ...
GABA inhibition modulates NMDA-R mediated spike timing dependent plasticity (STDP) in a biophysical model
Spike timing dependent plasticity (STDP) has been demonstrated in various neural systems of many animals. It has been shown that STDP depends on the target and the location of the synapse and is dynamically regulated by the activity of adjacent synapses,...
Comments