Recherche
In graph modification problems, we want to modify a graph through some operation (e.g. vertex/edge deletion/addition/contraction) to obtain a graph
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
/Talk in french/Exposé en français/ Les graphes fonctionnels sont des graphes dont chaque sommet a un degré sortant exactement égal à 1, et sont ainsi
Ultrametrics are representations of data that emphasize hierarchical properties and are widely used in data visualization and clustering. In the
Cluster reduction is a technique that can be used to speed up the construction of phylogenetic networks from sets of trees, or so we thought. Baroni