Minimum Size Tree-Decompositions

A conflict in the structured folksonomy emerges when different relations have been proposed or approved by different users on the same pair of tags (if a user changes his mind,

all, we prove that the Minimum Duplication problem is APX-hard, even when the input consists of five uniquely leaf-labelled gene trees (improving upon known results on the complexity

First of all, we prove that the Minimum Duplication problem is APX-hard, even when the input consists of five uniquely leaf-labelled gene trees (progressing on the complexity of

Computational results based on randomly generated graphs show that the number of k -branch vertices included in the spanning tree increases with the size of the vertex set V,

A la maternité Lalla Meryem [6], le cancer vulvaire occupe le 3 ème rang chez la femme ménopausée après les cancers du col et du sein avec un taux de 14,7%, alors qu’avant

Moreover, when used for xed classes G of graphs having optimum (APSPs) compact routing schemes, the construction of an MDST of G ∈ G may be performed by using interval, linear

By considering (H, k) stable graph with minimum size, it must be clear that we can add some isolated vertices, the resulting graph remains to be a (H, k) stable graph with

an increased number of Paneth cells, stained with anti-lyzozyme antibody, in adult rats colonized at birth with a genotoxic E.. coli