Exact distance coloring in trees

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,

We consider sets of words (sequences of symbols) and their corresponding generating functions to get precise average case analysis (here expected value and variance) of

† Supported by the Ministry of Science and Technology of Spain, and the European Regional Development Fund (ERDF) under project-BFM-2002-00412 and by the Catalan Research Council

Knowing an algorithm for edges coloring of a 3-regular graph called cubic, without isthmus, we know how to find the chromatic number of any graph.. Indeed, we explain how

In Section 6, we prove that the MEC problem is NP-complete even for complete graphs with bi-valued edge weights, and we give an asymptotic 4 3 -approximation algorithm for

We study the following generalization of the classical edge coloring problem: Given a weighted graph, find a partition of its edges into matchings (colors), each one of weight equal

The main tool that will enable us to use names to establish lower bounds for the rotation distance is a binary relation that provides a description of the shape of a tree in terms

Reducing the Number of Binary Splits, in Decision Tree Induction, by means of an Hierarchical Classification. Israël-César Lerman, Joaquim