In this paper, we propose an empirical study of the centrality of actors in network. The data was collected among publicly available information of the boa...

In this paper, the first steps toward the use of the Variable Neighborhood Search metaheuristic are explained. The method is presented step by step using an...

In this paper, we summarize some properties of the Cartesian product of graphs related to degree and distance-based invariants. Then, we investigate how mu...

More than fifteen years after the beginning of the development of AutoGraphiX (AGX), a third version of the software is made available. Since the program w...

In this paper, we propose an empirical study of the centrality of actors in network. The data was collected among publicly available information of the boa...

An edge-coloring of a graph \(G=(V,E)\) is a function \(c\) that assigns an integer \(c(e)\) (called color) in \(\{0,1,2,\dotsc\}\) to every edge `(...

The Euclidean distance between the eigenvalue sequences of graphs \(G\) and \(H\), on the same number of vertices, is called the spectral distance &nb...

L'écriture est une activité humaine complexe qui implique l'utilisation par le scripteur d'outils aujourd'hui variés (papier-crayon, papier-clavier, écran-cl...

La recherche à voisinages variables (RVV), ou <i>Variable Neighborhood Search (VNS)</i> en anglais est une métaheuristique dont l'invention est due à Nenad ...

In this paper we propose the use of twin graphs for optical transport network (OTN) physical topology design. Some properties inherent to twin graphs are fa...

Le nombre de Cahiers du GERAD vient de dépasser 2000. C'est un nombre qui en dit long sur l'activité du centre. Nous profiterons de cette occasion pour fa...

In the present paper, we are interested in studying mathematical properties of the Balaban index of connected graphs. We present a discussion on and refuta...

Transmission and betweenness centrality are key concepts in communication networks theory. In this paper, a series of network descriptors based on betweenne...

In this paper, we propose an algorithm to solve multi objective optimization problem where the objects under study are graphs. The proposed algorithm is des...

Introduced during the late nineties of the last century, Variable Neighborhood Search (VNS) was first designed for solving specific problems in combinatorial...

This paper presents a decomposition approach for solving a variant of the Routing and Wavelength Assignment (RWA) problem, in which all connection requests a...

Betweenness centrality was proposed about 35 years ago by Freeman. Since then, it was widely used mainly for analyzing social networks. According to <i>Web...

Since the late forties of the last century, methods of operations research have been extensively used to solve problems in graph theory, and graph theory has...

Using a heuristic optimization module based upon Variable Neighborhood Search (VNS), the system AutoGraphiX's main feature is to find extremal or near extre...

Finding communities, or clusters, or modules, in networks can be done by optimizing an objective function defined globally and/or by specifying conditions wh...