7 papers
Greedy Optimization of Resistance-based Graph Robustness with Global and Local Edge Insertions
Maria Predari, Lukas Berner, Robert Kooij +1
The total effective resistance, also called the Kirchhoff index, provides a robustness measure for a graph . We consider two optimization problems of adding new edges to …
An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures
Maria Predari, Charilaos Tzovas, Christian Schulz +1
Processing massive application graphs on distributed memory systems requires to map the graphs onto the system's processing elements (PEs). This task becomes all the more important…
New Approximation Algorithms for Forest Closeness Centrality -- for Individual Vertices and Vertex Groups
Alexander van der Grinten, Eugenio Angriman, Maria Predari +1
The emergence of massive graph data sets requires fast mining algorithms. Centrality measures to identify important vertices belong to the most popular analysis methods in graph mi…
Distributing Sparse Matrix/Graph Applications in Heterogeneous Clusters -- an Experimental Study
Charilaos Tzovas, Maria Predari, Henning Meyerhenke
Many problems in scientific and engineering applications contain sparse matrices or graphs as main input objects, e.g. numerical simulations on meshes. Large inputs are abundant th…
Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis
Eugenio Angriman, Maria Predari, Alexander van der Grinten +1
The ubiquity of massive graph data sets in numerous applications requires fast algorithms for extracting knowledge from these data. We are motivated here by three electrical measur…
Guidelines for Experimental Algorithmics in Network Analysis
Eugenio Angriman, Alexander van der Grinten, Moritz von Looz +4
The field of network science is a highly interdisciplinary area; for the empirical analysis of network data, it draws algorithmic methodologies from several research fields. Hence,…