Recherche
In order to further develop the theory of packing trees and packing forests in an undirected graph, we extended the notion of supermodular functions
Modélisation de la motivation à interagir comme fonction de récompense pour l'apprentissage par renforcement et pour un robot coach. Sao Mai Nguyen
In computational biology, phylogenetics is the study of evolutionary histories, their reconstruction from data, their comparison, and interaction
Given a graph $G$ and an integer $k \geq 2$, let $\chi'_k(G)$ denote the minimum number of colours required to colour the edges of $G$ such that, in
In graph modification problems, we want to modify a graph through some operation (e.g. vertex/edge deletion/addition/contraction) to obtain a graph
A central concept in social choice theory is that of a Condorcet winner: an outcome that defeats every alternative in a pairwise majority vote. While
For a fixed graph H, the H-coloring problem takes as an instance a graph G and asks whether there exists a homomorphism from G to H, i.e., a mapping f