Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Analysis of Or-parallel execution models
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constraint logic programming: selected research
Constraint logic programming: selected research
Communicating sequential processes
Communications of the ACM
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Graph Model for Fault-Tolerant Computing Systems
IEEE Transactions on Computers
Quantifying fault recovery in multiprocessor systems
Mathematical and Computer Modelling: An International Journal
Time-varying graphs and dynamic networks
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
Proceedings of the 18th annual international conference on Mobile computing and networking
Agreement in directed dynamic networks
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
| Hi-index | 0.98 |
Research in graph theory has focused on studying the structure of graphs with the assumption that they are static. However, in many applications, the graphs that arise change with time, i.e., they are dynamic in nature. This is especially true of applications involving graph models in computer science. We present an expository study of dynamic graphs with the main driving force being practical applications. We first develop a formal classification of dynamic graphs. This taxonomy in the form of generalizations and extensions will in turn suggest new areas of application. Next, we discuss areas where dynamic graphs arise in computer science such as compilers, databases, fault-tolerance, artificial intelligence, and computer networks. Finally, we propose approaches that can be used for studying dynamic graphs. The main objective in any study of dynamic graphs should be to 1.(i) extend results developed for static graph theory to dynamic graphs, 2.(ii) study the properties that describe how a dynamic graph changes, 3.(iii) investigate problems and issues in dynamic graph theory that are raised by practical applications of dynamic graphs in computer science.