No. Title Author Year
1 Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis Angriman, Eugenio et al. 2020
2 High-Quality Hierarchical Process Mapping Faraj, Marcelo Fonseca et al. 2020
3 High-Performance Graph Algorithms (Dagstuhl Seminar 18241) Meyerhenke, Henning et al. 2018
4 Scalable Katz Ranking Computation in Large Static and Dynamic Graphs van der Grinten, Alexander et al. 2018
5 Faster Betweenness Centrality Updates in Evolving Networks Bergamini, Elisabetta et al. 2017
6 Maxent-Stress Optimization of 3D Biomolecular Models Wegner, Michael et al. 2017
7 High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461) Meyer, Ulrich Carsten et al. 2015
8 On Dynamic Graph Partitioning and Graph Clustering using Diffusion Meyerhenke, Henning et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 8

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI