Call for Papers

Money or data tansfers, contacts between individuals, product sales, network traffic, messages, or travels may all be modeled as link streams, i.e. sequences of links with temporal information. Studying the structure and dynamics of such streams is therefore crucial for many fundamental and applied questions. This raises many challenging issues, which are at the core of an intense research activity currently, with contributions from graph theory, combinatorics, probabilities, complex networks, signal processing, and others.

Graph structures are used to model computer networks. Servers, hosts or hubs in a network represent vertices in a graph and edges represent connections between them. Each vertex in a graph is a possible location for an intruder (fault in a computer network, spoiled device) and, in this sense, a correct surveillance of each vertex of the graph to control such a possible intruder is worthwhile. According to these facts, it is desirable to uniquely recognize each vertex of the graph. In connection with this problem, the notion of metric generators (also called resolving sets or locating sets) were introduced in the  1970's and, due to this, the concept of metric dimension in graphs is nowadays well studied, which is also somehow based on the fact that the number of researchers on the topic have significantly increased in the last two decades.
