Dynamic graph models

Mathematical and Computer Modelling

Volumn 25, Issue 7, 1997, Pages 79-87

  Harary, F ^a   Gupta, G ^a  

^a New Mexico State University   (United States)

Author keywords

Dynamic graphs; Graph models in computer science; Graph theory

Indexed keywords

COMPUTER SCIENCE; DATA STRUCTURES; GRAPH THEORY; LOGIC PROGRAMMING;

DYNAMIC GRAPH MODELS; STATIC GRAPH THEORY;

MATHEMATICAL MODELS;

EID: 0031127943     PISSN: 08957177     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0895-7177(97)00050-2     Document Type: Article

References (31)

1. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, (1969).
2. R.A. Kowalski, Predicate logic as a programming language, Proc. IFIPS Congress, (1974).
3. L. Sterling and E. Shapiro, The Art of Prolog, Second edition, MIT Press, Cambridge, MA, (1994).
4. J.W. Lloyd, Foundations of Logic Programming, Second edition, Springer-Verlag, Berlin, (1987).
5. G. Gupta and B. Jayaraman, Analysis of OR-parallel execution models, In ACM Transactions on Programming Languages and Systems (ACM TOPLAS), Vol. 15, pp. 659-680, (1993).
6. E. Rich and K. Knight, Artificial Intelligence, McGraw-Hill, New York, (1983).
7. F. Harary and J.P. Hayes, Node fault tolerance in graphs, Networks (to appear).
8. F. Harary and J.P. Hayes, Edge fault tolerance in graphs, Networks 23, 135-142, (1993).
9. C.A.R. Hoare, Communicating sequential processes, In Communications of the ACM, Vol. 21, pp. 666-677, (1978).
10. D. May, Programming in occam, SIGPLAN Notices 18, 69-79, (1983).
11. T. Cormen, C. Lieserson and R. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, (1989).
12. J.D. Ullman, Principles of Database Systems, Computer Science Press, (1988).
13. A. Aho, J.D. Ullman and R. Sethi, Compilers: Principles, Techniques, and Tools, Addison-Wesley, Reading, MA, (1986).
14. th ACM Symposium on Principles of Programming Languages, pp. 238-252, (1977).
15. F. Harary and M. Malek, Quantifying fault recovery in multiprocessor systems, Mathl. Comput. Modelling 17 (11), 97-104, (1993).
16. J.P. Hayes, A graph model for fault-tolerant computer systems, IEEE Trans. Comput. C-25, 879-884, (1976).
17. K. Menger, Zur allgemeinen Kruventheorie, Fund. Math. 10, 96-115, (1927).
18. L.R. Ford and D.R. Fulkerson, Maximal flow through a network, Canadian J. Math. 8, 399-404, (1956).
19. L.R. Ford and D.R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, NJ, (1962).
20. F. Harary, Conditional connectivity, Networks 13, 347-357, (1983).
21. F. Harary, On the notion of balance of a signed graph, Michigan Math. J. 2, 143-146, (1953).
22. F. Harary and D. Cartwright, Structural balance: A generalization of Heider's theory, Psychol. Review 63, 277-293, (1956).
23. F. Harary, A structural analysis of the situation in the Middle East in 1956, J. Conflict Resolution 5, 167-178, (1961).
24. F. Harary, Graphing conflict in international relations, Papers Peace Sci. Soc. Intl. 27, 1-9, (1977).
25. F. Harary and A. Blass, Deletion versus alteration in finite structures, J. Combin. Inform. System Sci. 7, 139-142, (1982).
26. F. Harary and L. Shader, Perfect play in 2-color triangle avoidance on five nodes gives a draw, J. Recreational Math. (to appear).
27. W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, (Second edition), Wiley, New York, (1957).
28. F. Harary and B. Lipstein, The dynamics of brand loyalty: A Markovian approach, Operations Research 10, 19-40, (1962).
29. F. Harary, Generalized Ramsey Theory I to XIII, In The Theory and Applications of Graphs, (Edited by G. Chartrand et al.), pp. 373-390, Wiley, New York, (1981).
30. P. van Hentenryck, Constraint Handling in Prolog, MIT Press, Cambridge, MA, (1987).
31. F. Benhamou and A. Colmerauer, Editors, Constraint Logic Programming: Selected Research, MIT Press, Cambridge, MA, (1993).