The network inhibition problem

The Network Inhibition Problem

[1]  Frank Harary,et al.  Graph Theory , 2016 .

[2]  R. Ravi,et al.  Approximation through multicommodity flow , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[3]  Alok Aggarwal,et al.  Geometric Applications of a Matrix Searching Algorithm , 1986, Symposium on Computational Geometry.

[4]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..

[5]  William H. Cunningham,et al.  Optimal attack and reinforcement of a network , 1985, JACM.

[6]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[7]  Dan Bienstock,et al.  Some Generalized Max-Flow Min-Cut Problems in the Plane , 1991, Math. Oper. Res..

[8]  Edward Minieka,et al.  Maximal, Lexicographic, and Dynamic Network Flows , 1973, Oper. Res..

[9]  Siam J. CoMPtrr,et al.  FINDING A MAXIMUM CUT OF A PLANAR GRAPH IN POLYNOMIAL TIME * , 2022 .

[10]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[11]  Andrew V. Goldberg,et al.  A new approach to the maximum flow problem , 1986, STOC '86.

[12]  J. Scott Provan,et al.  Calculating bounds on reachability and connectedness in stochastic networks , 1983, Networks.

[13]  H. Joksch.  The shortest route problem with constraints , 1966 .

[14]  Kurt Mehlhorn,et al.  Can A Maximum Flow be Computed on o(nm) Time? , 1990, ICALP.

[15]  Norman E. Gibbs,et al.  The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.

[16]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[17]  David S. Johnson,et al.  The NP-Completeness Column: An Ongoing Guide , 1982, J. Algorithms.

[18]  Peter L. Hammer,et al.  Cut-threshold graphs , 1991, Discret. Appl. Math..

[19]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

[20]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[21]  Alok Aggarwal,et al.  Improved Algorithms for Economic Lot Size Problems , 1993, Oper. Res..

[22]  Alon Itai,et al.  Maximum Flow in Planar Networks , 1979, SIAM J. Comput..

[23]  David S. Johnson.  The NP-Completeness Column: An Ongoing Guide , 1986, J. Algorithms.

[24]  Alok Aggarwal,et al.  Geometric applications of a matrix-searching algorithm , 1987, SCG '86.

[25]  John H. Reif,et al.  Minimum s-t Cut of a Planar Undirected Network in O(n log2(n)) Time , 1983, SIAM J. Comput..

[26]  Daniel J. Kleitman,et al.  An Almost Linear Time Algorithm for Generalized Matrix Searching , 1990, SIAM J. Discret. Math..

[27]  Alok Aggarwal,et al.  Applications of generalized matrix searching to geometric algorithms , 1990, Discret. Appl. Math..

[28]  Dan Gusfield,et al.  Computing the Strength of a Graph , 1991, SIAM J. Comput..

[29]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[30]  Robert E. Tarjan,et al.  A faster deterministic maximum flow algorithm , 1992, SODA '92.

[31]  Shuji Tsukiyama,et al.  An Algorithm to Enumerate All Cutsets of a Graph in Linear Time per Cutset , 1980, J. ACM.

[32]  Dorit S. Hochbaum,et al.  Polynomial algorithm for the k-cut problem , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[33]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[34]  Greg N. Fredericicson.  Planar Graph Decomposition and All Pairs Shortest Paths , 1991 .

[35]  Refael Hassin,et al.  An O(n log2 n) Algorithm for Maximum Flow in Undirected Planar Networks , 1985, SIAM J. Comput..

[36]  Greg N. Frederickson,et al.  Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..