Filter Results:
- Full text PDF available (41)
Publication Year
2005
2018
- This year (10)
- Last 5 years (53)
- Last 10 years (81)
Publication Type
Co-author
Journals and Conferences
Learn More
- Henning Meyerhenke, Burkhard Monien, Thomas Sauerwald
- IPDPS
- 2008
- Aydin Buluç, Henning Meyerhenke, Ilya Safro, Peter Sanders, Christian Schulz
- Algorithm Engineering
- 2016
We survey recent trends in practical algorithms for balanced graph partitioning, point to applications and discuss future research directions.
- Christian Staudt, Henning Meyerhenke
- IEEE Transactions on Parallel and Distributed…
- 2016
The amount of graph-structured data has recently experienced an enormous growth in many applications. To transform such data into useful information, fast analytics algorithms and software tools are… (More)
- Christian Staudt, Aleksejs Sazonovs, Henning Meyerhenke
- ArXiv
- 2014
We introduce NetworKit, an open-source software package for high-performance analysis of large complex networks. Complex networks are equally attractive and challenging targets for data mining, and… (More)
- Henning Meyerhenke, Burkhard Monien, Stefan Schamberger
- Parallel Computing
- 2009
The NP-hard graph partitioning problem is an important subtask in load balancing and many other applications. It requires the division of a graph’s vertex set into P equally sized subsets such that… (More)
- Jeremy Kepner, Peter Aaltonen, +13 authors Timothy G. Mattson
- 2016 IEEE High Performance Extreme Computing…
- 2016
The GraphBLAS standard (GraphBlas.org) is being developed to bring the potential of matrix-based graph algorithms to the broadest possible audience. Mathematically, the GraphBLAS defines a core set… (More)
Copying and reprinting. Material in this book may be reproduced by any means for educational and scientific purposes without fee or permission with the exception of reproduction by services that… (More)
- Elisabetta Bergamini, Henning Meyerhenke, Christian Staudt
- ALENEX
- 2015
Betweenness centrality ranks the importance of nodes by their participation in all shortest paths of the network. Therefore computing exact betweenness values is impractical in large networks. For… (More)
- Christian Staudt, Aleksejs Sazonovs, Henning Meyerhenke
- Network Science
- 2016
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… (More)
- Henning Meyerhenke, Burkhard Monien, Stefan Schamberger
- Proceedings 20th IEEE International Parallel…
- 2006
We propose a load balancing heuristic for parallel adaptive finite element method (FEM) simulations. In contrast to most existing approaches, the heuristic focuses on good partition shapes rather… (More)