Dynamic graph models

Harary, Frank; Gupta, Gaurav

doi:10.1016/s0895-7177(97)00050-2

Cited by 154 publications

(82 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The importance of studying dynamic graphs and their associated problems has been highlighted by Harary and Gupta [7] who outlined many applications, especially in the area of computer science, and postulated that techniques applied to static graphs should be extended for dynamic graphs. However, there has been very little research regarding methods designed explicitly for dynamic graphs.…”

Section: Dynamic Graph Colouring Problemsmentioning

confidence: 99%

Modifying Colourings Between Time-Steps to Tackle Changes in Dynamic Random Graphs

Hardy

Lewis

Thompson

2016

Evolutionary Computation in Combinatorial Optimization

View full text Add to dashboard Cite

Many real world operational research problems can be formulated as graph colouring problems. Algorithms for this problem usually operate under the assumption that the size and constraints of a problem are fixed, allowing us to model the problem using a static graph. For many problems however, this is not the case and it would be more appropriate to model such problems using dynamic graphs. In this paper we will explore whether feasible colourings for one graph at time-step t can be modified into a colouring for a similar graph at time-step t + 1 in some beneficial manner.

show abstract

Section: Dynamic Graph Colouring Problemsmentioning

confidence: 99%

Modifying Colourings Between Time-Steps to Tackle Changes in Dynamic Random Graphs

Hardy

Lewis

Thompson

2016

Evolutionary Computation in Combinatorial Optimization

View full text Add to dashboard Cite

show abstract

“…We have found many acceptable descriptions of TVGs in the literature. According to Harary et al, if we add in the definition of graph G described above, the function f defined in a set of vertices by: f : V −→ N and the function g defined in a set of edges by: g : E −→ N , then a temporal graph G = (V, E, f, g) isn't nothing else the modification of one of these parameters in time [26]. Casteights et al give a clear presentation concerning the TVGs in [14].…”

Section: Time Varying Graphs (Tvg)mentioning

confidence: 99%

Structural and dynamical analysis of complex networks

Mboup¹,

Diallo²,

Lô³

2016

Proceedings of the 2nd Information Technology and Mechatronics Engineering Conference (ITOEC 2016TOEC 2016)

View full text Add to dashboard Cite

Abstract. We encounter in real world large networks as diverse as neural networks, power grid, financial networks, friendship networks, Internet, WWW. These networks are commonly characterized by a large number of highly interconnected dynamical entities. They are so complex that they may give birth to many dynamic phenomena. Understanding at the same time the topological and dynamical aspect of complex networks is an important challenge. In this paper, we review on the fundamental elements of complex networks study. We include definitions, measurements, models used to analyse topology and dynamics of these systems. Moreover, we discuss some questions related to mobility and dynamic community detection in complex systems.

show abstract

“…A labelled multigraph was used as the basis for establishing the network in order to meet the required level of modelling expressiveness. In the context of the example study, the generated network is considered as an edge and node dynamic network (Harary & Gupta, 1997 required. Each step is illustrated using the information seeking example outlined in Section 3, which are boxed for clarity.…”

Section: Approach To Visualisationmentioning

confidence: 99%