Dynamic Graphs

[1]  A. R. Radcliffe-Brown.  ON SOCIAL STRUCTURE , 1940 .

[2]  Peter S Loubai.  A NETWORK EVALUATION PROCEDURE , 1967 .

[3]  D. Siljak.  Vulnerability of Dynamic Systems , 1977 .

[4]  R. May,et al.  Stability and Complexity in Model Ecosystems , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  H. C. Tseng.  Error-feedback servomechanism in non-linear systems , 1992 .

[6]  Francesca Rossi,et al.  Graph Grammars as Context-Dependent Rewriting Systems: A Partial Ordering Semantics , 1992, CAAP.

[7]  Shimon Even,et al.  An On-Line Edge-Deletion Problem , 1981, JACM.

[8]  John A. Jacquez,et al.  Qualitative Theory of Compartmental Systems , 1993, SIAM Rev..

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

[10]  D. Siljak,et al.  Lotka-Volterra equations: Decomposition, stability, and structure , 1980 .

[11]  Leon O. Chua,et al.  Practical Numerical Algorithms for Chaotic Systems , 1989 .

[12]  P. Moylan,et al.  Stability criteria for large-scale systems , 1978 .

[13]  Dragoslav D. Šiljak,et al.  On stability of large-scale systems under structural perturbations. , 1973 .

[14]  Dmitrii O. Logofet,et al.  Matrices and Graphs: Stability Problems in Mathematical Biology , 1995 .

[15]  D. Siljak,et al.  On stability of interval matrices , 1994, IEEE Trans. Autom. Control..

[16]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[17]  Shimon Even,et al.  Updating distances in dynamic graphs , 1985 .

[18]  Kenneth J. Arrow,et al.  The Genesis of Dynamic Systems Governed by Metzler Matrices , 1977 .

[19]  W. Walter.  Differential and Integral Inequalities , 1970 .

[20]  Shigui Ruan,et al.  Connective stability of discontinuous large scale systems , 1991 .

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

[22]  N. Krasovskii,et al.  Uniform asymptotic stability of systems of differential equations with a small parameter in the derivative terms , 1961 .

[23]  Dragoslav D. Siljak,et al.  A learning scheme for dynamic neural networks: equilibrium manifold and connective stability , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[24]  A. A. Martynyuk.  Stability of discrete systems under structural perturbations , 1997 .

[25]  Greg N. Frederickson,et al.  Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[26]  Hassan K. Khalil,et al.  Singular perturbation methods in control : analysis and design , 1986 .

[27]  D. D. Shjak.  Competitive Analysis of the Arms Race , 1976 .

[28]  Zvi Galil,et al.  Fully Dynamic Algorithms for 2-Edge Connectivity , 1992, SIAM J. Comput..

[29]  M. Rauch,et al.  Fully dynamic biconnectivity in graphs , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[30]  Gregory D. Hess,et al.  An Introduction To Lewis Fry Richardson and His Mathematical Theory of War and Peace , 1995 .

[31]  Don Coppersmith,et al.  Matrix multiplication via arithmetic progressions , 1987, STOC.

[32]  D. Siljak,et al.  Multiplex control systems: Stochastic stability and dynamic reliability , 1981, 1981 20th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.

[33]  Masao Ikeda,et al.  Decentralized stabilization for expanding construction of large-scale systems , 1990 .

[34]  D. Knuth,et al.  Mathematics for the Analysis of Algorithms , 1999 .

[35]  Greg N. Frederickson,et al.  Data structures for on-line updating of minimum spanning trees , 1983, STOC.

[36]  Chih-fen Chang,et al.  Qualitative Theory of Differential Equations , 1992 .

[37]  J. Ian Munro,et al.  Efficient Determination of the Transitive Closure of a Directed Graph , 1971, Inf. Process. Lett..

[38]  M. Vidyasagar,et al.  Qualitative Analysis of Large Scale Dynamical Systems , 2012, IEEE Transactions on Systems, Man, and Cybernetics.

[39]  Thomas W. Reps,et al.  On the Computational Complexity of Dynamic Graph Problems , 1996, Theor. Comput. Sci..

[40]  Thomas W. Reps,et al.  An Incremental Algorithm for a Generalization of the Shortest-Path Problem , 1996, J. Algorithms.

[41]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[42]  Mikkel Thorup,et al.  Minimizing Diameters of Dynamic Trees , 1997, ICALP.

[43]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[44]  M. A. Aizerman,et al.  Dynamic Approach to Analysis of Structures Described by Graphs (Foundations of Graph-Dynamics) , 1987 .

[45]  Dragoslav D. Šiljak,et al.  Large-Scale Dynamic Systems: Stability and Structure , 1978 .

[46]  Irwin W. Sandberg,et al.  On the Mathematical Theory of Interaction in Social Groups , 1974, IEEE Trans. Syst. Man Cybern..

[47]  Robert E. Tarjan,et al.  A data structure for dynamic trees , 1981, STOC '81.

[48]  V. V. Rodionov.  The parametric problem of shortest distances , 1968 .

[49]  K. Arrow,et al.  General Competitive Analysis , 1971 .

[50]  Y. Ohta,et al.  Asymptotic behavior of nonlinear compartmental systems: Nonoscillation and stability , 1978 .

[51]  G. S. Ladde,et al.  Cellular systems—I. stability of chemical systems , 1976 .

[52]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.