Automatic document summarization aims at creating a shorter version of one or more documents to help users digest large amounts of information more easily by...

The time-stamped database provided by Google traces the code contributions to Chrome browser on the period from September 2008 to January 2014. It describes ...

GenoGraphiX-Log 2.0 (abbreviation GGXLog) is a keystroke logging software that was developed as a collaboration between <a href="" title="https://www.h...

Aggregator is an open-source python package which aims to facilitate the exploitation of relational datasets by automating feature aggregation.

This work proposes strategies to handle three types of constraints in the context of blackbox optimization: binary constraints that simply indicate if they a...

In an optimization problem, multiplying an inequality constraint by a positive scalar has no effect on the domain. However, such a transformation might have...

In this paper, we establish the maximum number of basic shortest paths in Cartesian product graphs and bounds on the maximum number of the vertex-disjoint sh...

For the last decades, community detection is a well-studied problem because it has applications in various fields. Variable Neighborhood Search (VNS) is an e...

Distance measures play an important role in data analysis, mainly for clustering purpose, but also for data representation (for instance using multidimension...

Any telecommunication network is subject to a node or link failure at any given time. Such a failure may impact the quality of the services provided by the n...

Necessary and sufficient conditions are provided for the existence of a simple graph, or a simple connected graph with given numbers \(m_{ij}\) of edges ...

Graph theoretical heuristics are used extensively in many fields to solve approximately large scale optimization problems. Graph theoretical heuristics can a...

Considering a graph as a network of resistances, Klein and Randić (1993) proposed the definition of a distance measure. Indeed, if each edge of the graph re...

Trends in wireless networks are proceeding toward increasingly dense deployments, supporting resilient interconnection for applications that carry ever highe...

In this paper, we propose a new scheme for building algorithms to detect communities in networks. This new approach is based upon a vertex centrality measur...

Extreme Learning Machine (ELM) has recently increased popularity and has been successfully applied to a wide range of applications. Variants using regulariza...

This paper presents the results of two explorations: one, exhaustive, of the graph sets from 4 to 10 vertices, and other, using AGX-III program on graphs fro...

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 `(...

In the literature, graphs are often studied in terms of invariants, for instance the number of vertices or edges, the stability number, the chromatic number ...

Writing is a complex process and it is difficult to know how to write well in order to make a good text. Many fields and techniques are combined to analyze h...

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...

Clusterwise regression is a clustering technique where multiple lines or hyperplanes are fit to mutually exclusive subsets of a dataset such that the sum of ...

In the last ten years, finding communities in networks, has been the subject of intense studies. If modularity maximization is still one of the mostly studi...

Finding communities, or clusters, in networks, or graphs, has been the subject of intense studies in the last ten years. The most used criterion for that pu...

The decomposition of the movement of the eye into different categories is critical to their study. According to the algorithm used, some movements may signi...

In this paper, we present an edge and vertex decomposition of the Wiener index (<i>W</i>) that is related to the concept of betweenness centrality used in so...

There are currently several systems to collect online writing data in keystroke logging. Each of these systems provides reliable and very precise data. Unf...

Les outils informatiques de capture en temps réel (Scriptlog, inputlog ou Eye and Pen) procurent des données d'une qualité inégalée (par les autres méthodes)...

A branch and bound strategy is proposed for solving the clusterwise regression problem, extending Brusco's repetitive branch and bound algorithm (RBBA). The ...

Finding modules, or clusters, in networks currently attracts much attention in several domains. The most studied criterion for doing so, due to Newman and Gi...

Exact global optimization of the clusterwise regression problem is challenging and there are currently no published feasible methods for performing this clus...

This study investigated the influence of working memory capacity on the dynamics of text composition from source, notably the strategy used by writers to con...

The distance energy of a graph <i>G</i> is defined as <img src="/cgi-bin/mimetex.cgi?ED(G) = \sum |\mui |">, where <img src="/cgi-bin/mimetex.cgi?\mu_i"> i...

In this work we develop new methods and algorithms for building networks with high synchronizability of dynamical processes occurring at their nodes. In addi...

This paper evaluates the changes in efficiency and productivity of coal-fired electricity generation of 30 Chinese administrative regions from 1999 to 2007. ...

A <i>k</i>-edge-coloring of a graph <i>G=(V,E)</i> is a function <i>c</i> that assigns an integer <i>c(e)</i> (called color) in <i>{0,1, ..., k-1}</i> to eve...

Given a graph <i>G=(V,E)</i>, the first Zagreb index <i>M</i>₁ is the sum of its vertices squared degrees and the second Zagreb index <i>M</i><sub...

Necessary and sufficient conditions are provided for existence of a simple graph <i>G</i>, and for a simple and connected graph <i>G'</i> with given numbers ...

Question retrieval systems, unlike question answering systems, exploit the knowledge contained in previously answered questions to answer new ones by returni...

Based upon a robust optimization technique, Variable Neighborhood Search (VNS), we use simulation to find rules for identifying the correct Minkowski paramet...

Clusterwise regression is a technique for clustering data. Instead of using the classical homogeneity or separation criterion, clusterwise regression is ba...

The AutoGraphiX system (AGX 1 and AGX 2) for interactive, and for several functions automated, graph theory, discovers conjectures of algebraic or structura...

A graph invariant is a function of a graph <i>G</i> which does not depend on labeling of <i>G</i>’s vertices or edges. An algebraic expression of one or sev...

The multidimensional scaling (MDS) aims at finding coordinates for a set of <i>n</i> objects in a (low) <i>q</i> dimensional space that best fits dissimilar...

We consider the problem of separating two sets of points in an Euclidean space with a hyperplane that minimizes the sum of <i>L_p</i>-norm distanc...

<i>L</i>₁ norm discrimination consists in finding the hyperplane that minimizes the sum of <i>L</i>₁ norm distances between the hyperp...

A survey is made of the AutoGraphiX (AGX) research program for computer as- sisted and, for some functions, automated graph theory.

The AutoGraphiX (AGX) system for computer assisted or, for some of its functions, fully automated graph theory was developed at GERAD, Montreal since 1997. ...

In this paper, we present tools to help understanding the dynamics of cognitive processes involved in handwriting and in text composition. Three computer sy...

Conjectures in graph theory have multiple forms and involve graph invariants, graph classes, subgraphs, minors and other concepts in premisses and/or conclu...

Let <i>G</i> be a simple graph on <i>n</i> vertices with the eigenvalues (of an adjacency matrix) &lambda;₁ &ge; &lambda;₂ &ge; ... &g...

After a short historic review, we briefly describe a new algorithm for constructive enumeration of polyhex and fusene hydrocarbons. In this process our alg...

The AutoGraphiX (AGX) system determines classes of extremal or near extremal graphs with a Variable Neighborhood Search heuristic. From these, conjectures m...

Let <i>G</i> be a graph and <i>d_v</i> the degree (= number of first neighbors) of its vertex <i>v</i>. The connectivity index of <i>G</i> is <img...

In this paper, a fast and complete method to constructively enumerate fusenes and benzenoids is given. It is fast enough to construct several million non is...

Graffiti's conjecture 105 states that for any tree the range of transmissions of distance is greater than or equal to the range of degrees. After using the ...

On the basis of a variable-neighbourhood search with the AutoGraphiX software, it is conjectured that for even numbers of atoms the fully conjugated acycli...

The distance matrix of a chemical graph can be computed in quadratic time, and from it can be obtained the distance level patterns (DLP), Wiener, Szeged and...

In the set of bicolored trees with given numbers of black and of white vertices we describe those for which the largest eigenvalue is extremal (maximal or m...

The definition of a fullerene as a cubic polyhedron made up entirely of pentagons and hexagons is compatible with a huge variety of isomeric forms for struc...

Fusenes are simply connected, geometrically planar or non-planar polyhexes. Enumeration of such systems with up to 20 hexagons, <i>i.e.,</i> a set 4000 tim...

Given a set of <i>m</i> observations on <i>n</i> variables, an 0(<i>mn</i>²) algorithm is proposed to find a basis of all affine relations betwee...

By means of the variable neighborhood search algorithm, a newly designed heuristic approach to combinatorial optimization, we established the structure of t...

The recently developed Variable Neighborhood Search (VNS) meta-heuristic for combinatorial and global optimization is outlined together with its specializat...

The chemical trees on <i>n</i> vertices (= molecular graphs representing alkanes with <i>n</i> carbon atoms) with minimal, second-minimal, third-minimal, ma...

Let <i>G</i> be a connected graph and let <i>D</i> be its diameter. Denote by <i>d</i>(<i>G,k</i>) the number of pairs of vertices in <i>G</i> that are at d...

An algorithm based upon the boundary-edges code and the reverse search method is proposed for enumerating non-isomorphic planar simply connected polyhexes. ...

Finding extremal graphs for expressions involving one or more invariants is viewed as a problem of combinatorial optimization. The recent Variable Neighborh...