Alane Marie de Lima

Universidade Federal do Paraná | UFPR · Department of Computer Science

In this work we present a sampling algorithm for estimating the local clustering of each vertex of a graph. Let G be a graph with n vertices, m edges, and maximum degree \(\varDelta \). We present an algorithm that, given G and fixed constants \(0< \varepsilon , \delta , p < 1\), outputs the values for the local clustering coefficient within \(\var...

In this work we investigate the problem of estimating the percolation centrality of all vertices in a weighted graph. The percolation centrality measure quantifies the importance of a vertex in a graph that is going through a contagious process. The fastest exact algorithm for the computation of this measure in a graph G with n vertices and m edges...

Considere o problema de computar o caminho mínimo entre cada par de vértices (APSP) de um grafo, desde que o caminho tenha alta centralidade, sendo que a métrica de centralidade em questão reflete a "importância'' do caminho no grafo. Propomos um algoritmo para este problema que usa uma estratégia de amostragem baseada em Dimensão-VC e médias de Ra...

In this work we investigate the problem of estimating the percolation centrality of all vertices in a weighted graph. The percolation centrality measure quantifies the importance of a vertex in a graph that is going through a contagious process. The fastest exact algorithm for the computation of this measure in a graph with vertices and edges runs...

In this paper we are interested in the all-pairs shortest paths problem (APSP) for an input graph G assumed to be connected undirected with nonnegative real edge weights. In the exact deterministic case, it is an open question whether this problem admits a O(n3−c) time algorithm, for any constant c>0, even in the case where edge weights are natural...

In this work we investigate the problem of percolation centrality, a generalization of betweenness centrality, in a weighted graph G under the light of sample complexity theory. For both betweenness and percolation centrality the computation of the {\it exact} value for a given vertex v is not known to be easier than the computation the same value,...

The graph coloring problem is the problem of partitioning the vertices of a graph into the smallest possible set of independent sets. Since it is a well-known NP-Hard problem, it is of great interest of the computer science finding results over exact algorithms that solve it. The main algorithms of this kind, though, are scattered through the liter...