André Luiz Pires Guedes

Learn More
This paper presents parallel versions of Gusfield's cut tree algorithm. Cut trees are a compact representation of the edge-connectivity between every pair of vertices of an undirected graph. Cut trees have many applications in combinatorial optimization and in the analysis of networks originated in many applied fields. However, surprisingly few works have(More)
In Brazil, most Deaf children (approximately 90%) are born into non-Deaf families. These children suffer prejudice in social situations and within their own families. They have few chances to get exposed to Sign Language (SL), the natural language of the Deaf, thus being deprived of adequate language acquisition and age-appropriate intellectual development.(More)
This work presents an algorithm for computing the maximum flow and minimum cut of undirected graphs, based on the well-known algorithm presented by Ford and Fulkerson for directed graphs. The new algorithm is equivalent to just applying Ford and Fulkerson algorithm to the directed graph obtained from original graph but with two directed arcs for each edge(More)
A distributed system-level diagnosis algorithm allows the fault-free nodes of a system to diagnose the state of all nodes in the system. Diagnosis has been successfully employed for dependable network fault management. In this paper we present a new hierarchical adaptive distributed system-level diagnosis algorithm, Hi-ADSD with Detours which has latency at(More)
A biclique of a graph G is a maximal induced complete bipartite subgraph of G. The biclique graph of G denoted by KB(G), is the intersection graph of all the bicliques of G. The biclique graph can be thought as an operator between the class of all graphs. The iterated biclique graph of G denoted by KB k (G), is the graph obtained by applying the biclique(More)