Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Predari, Maria"'
The total effective resistance, also called the Kirchhoff index, provides a robustness measure for a graph $G$. We consider two optimization problems of adding $k$ new edges to $G$ such that the resulting graph has minimal total effective resistance
Externí odkaz:
http://arxiv.org/abs/2309.08271
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 when PEs have non-uniform communication costs or the input is highly
Externí odkaz:
http://arxiv.org/abs/2107.02539
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 mining. A measure that is gaining attention is forest closeness centrali
Externí odkaz:
http://arxiv.org/abs/2101.06192
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 these days and require parallel processing for memory size and speed. To
Externí odkaz:
http://arxiv.org/abs/2011.01814
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 measures for the analysis of large small-world graphs $G = (V, E)$ -- i.e.,
Externí odkaz:
http://arxiv.org/abs/2006.13679
Autor:
Angriman, Eugenio, van der Grinten, Alexander, von Looz, Moritz, Meyerhenke, Henning, Nöllenburg, Martin, Predari, Maria, Tzovas, Charilaos
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, research procedures and descriptions of the technical results often d
Externí odkaz:
http://arxiv.org/abs/1904.04690
In this paper we propose a new method to enhance a mapping $\mu(\cdot)$ of a parallel application's computational tasks to the processing elements (PEs) of a parallel computer. The idea behind our method \mswap is to enhance such a mapping by drawing
Externí odkaz:
http://arxiv.org/abs/1804.07131
Publikováno v:
In Parallel Computing August 2017 66:22-39
Several dynamic graph data structures have been proposed in literature. Yet, these data structures either offer limited support for arbitrary graph algorithms or they are designed as part of specific frameworks (e.g., for GPUs or specialized hardware
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::44db8b41d0b556f5b8a41baedfa42132
Autor:
Predari, Maria, Esnard, Aurélien
Publikováno v:
SIAM Workshop on Combinatorial Scientific Computing
SIAM Workshop on Combinatorial Scientific Computing, Oct 2016, Albuquerque, United States
SIAM Workshop on Combinatorial Scientific Computing, Oct 2016, Albuquerque, United States
International audience; The execution of scientific applications on parallelarchitectures often dictates an efficient decomposi-tion of the computational load in order to ensurehigh performance. In literature, such applicationsoften use graph theory
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2d270314eb40ee76158c7100513d2400
https://hal.archives-ouvertes.fr/hal-01399392
https://hal.archives-ouvertes.fr/hal-01399392