Henning Meyerhenke
Biographic Data
| ID | 1752501 |
|---|---|
| NAME | Henning Meyerhenke |
| GIVEN NAMES | Henning |
| FAMILY NAME | Meyerhenke |
| SIGNATURE | MEYERHENKE H |
| AFFILIATIONS | Karlsruhe Institute of Technology |
| ORCID | 0000-0002-7769-726X |
| VERIFIED | Yes |
| TOTAL WORKS | 5 |
| TOTAL CITATIONS | 1 |
| WORKS AS AUTHOR | 5 |
| WORKS AS EDITOR | 0 |
| FIRST PUBLICATION YEAR | 2014 |
| LATEST PUBLICATION YEAR | 2023 |
| H-INDEX | 1 |
Greedy optimization of resistance-based graph robustness with global and local edge insertions
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 (i.e., is most robust)—one where the new edges can be anywhere in the graph and one where the new edges need to be incident to a specified focus node. The total effective resistance and effective resistanc…
Structure-preserving sparsification methods for social networks
An empirical comparison of Big Graph frameworks in the context of network analysis
NetworKit
We introduce NetworKit, an open-source software package for analyzing the structure of large complex networks. Appropriate algorithmic solutions are required to handle increasingly common large graph data sets containing up to billions of connections. We describe the methodology applied to develop scalable solutions to network analysis problems, including techniques like parallelization, heuristics for computationally expensive problems, efficien…
Benchmarking for Graph Clustering and Partitioning
NetworKit
We introduce NetworKit, an open-source software package for analyzing the structure of large complex networks. Appropriate algorithmic solutions are required to handle increasingly common large graph data sets containing up to billions of connections. We describe the methodology applied to develop scalable solutions to network analysis problems, including techniques like parallelization, heuristics for computationally expensive problems, efficien…
Benchmarking for Graph Clustering and Partitioning
Structure-preserving sparsification methods for social networks
An empirical comparison of Big Graph frameworks in the context of network analysis
NetworKit
We introduce NetworKit, an open-source software package for analyzing the structure of large complex networks. Appropriate algorithmic solutions are required to handle increasingly common large graph data sets containing up to billions of connections. We describe the methodology applied to develop scalable solutions to network analysis problems, including techniques like parallelization, heuristics for computationally expensive problems, efficien…
Greedy optimization of resistance-based graph robustness with global and local edge insertions
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 (i.e., is most robust)—one where the new edges can be anywhere in the graph and one where the new edges need to be incident to a specified focus node. The total effective resistance and effective resistanc…
Complex Network Analysis Techniques (5 works) · Computer Science (5 works) · Graph (4 works) · Theoretical Computer Science (4 works) · Advanced Graph Neural Networks (3 works) · Artificial Intelligence (3 works) · Graph Theory and Algorithms (3 works) · Algorithm (2 works) · Cluster analysis (2 works) · Data mining (2 works)