Certain subgraphs of a given graph G restrict the minimum number Ï‡(G) of colors that can be assigned to the vertices of G such that the endpoints of all edges receive distinct colors. Some of suchâ€¦ (More)

An equitable k-coloring of a graph is defined by a partition of its vertices into k disjoint stable subsets, such that the difference between the cardinalities of any two subsets is at most one. Theâ€¦ (More)

Let G = (V,E,Q) be a undirected graph, where V is the set of vertices, E is the set of edges, and Q = {Q1, . . . , Qq} is a partition of V into q subsets. We refer to Q1, . . . , Qq as the componentsâ€¦ (More)

Cloud computing establishes a new computing model where a wide range of computing resources are provided to several types of users. Especially for bioinformatics experiments modeled as scientificâ€¦ (More)

In this work, we study the behavior of Brazilian politicians and political parties with the help of clustering algorithms for signed social networks. For this purpose, we extract and analyze aâ€¦ (More)

A spanning caterpillar in a graph is a tree composed by a path such that all vertices not in the path are leaves. In the Minimum Spanning Caterpillar Problem ( ) each edge has two costs: a path costâ€¦ (More)

Evaluating balance in a social network has been a challenge for social network researchers. The degree of balance in a social group can be used as a tool to study whether and how this group evolvesâ€¦ (More)