The following pages link to Henning Meyerhenke (Q525112):
Displaying 33 items.
- Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering (Q525113) (← links)
- Engineering a combinatorial Laplacian solver: lessons learned (Q1736844) (← links)
- Beyond good partition shapes: an analysis of diffusive graph partitioning (Q1934315) (← links)
- On finding convex cuts in general, bipartite and plane graphs (Q2402674) (← links)
- Querying Probabilistic Neighborhoods in Spatial Data Sets Efficiently (Q2819527) (← links)
- (Q2922529) (← links)
- Drawing Large Graphs by Multilevel Maxent-Stress Optimization (Q2959740) (← links)
- Beyond Good Shapes: Diffusion-Based Graph Partitioning Is Relaxed Cut Optimization (Q3060790) (← links)
- Fully-Dynamic Approximation of Betweenness Centrality (Q3452779) (← links)
- Generating Random Hyperbolic Graphs in Subquadratic Time (Q3459884) (← links)
- Improving the Betweenness Centrality of a Node by Adding Links (Q4555544) (← links)
- (Q4580179) (← links)
- Updating Dynamic Random Hyperbolic Graphs in Sublinear Time (Q4629530) (← links)
- Finding All Convex Cuts of a Plane Graph in Cubic Time (Q4924654) (← links)
- Scalable Katz Ranking Computation in Large Static and Dynamic Graphs (Q5009604) (← links)
- Scalable Katz Ranking Computation in Large Static and Dynamic Graphs (Q5102079) (← links)
- (Q5111761) (← links)
- Group Centrality Maximization for Large-scale Graphs (Q5147496) (← links)
- Group-Harmonic and Group-Closeness Maximization – Approximation and Engineering (Q5147536) (← links)
- Approximating Betweenness Centrality in Large Evolving Networks (Q5232530) (← links)
- <i>k</i>-way Hypergraph Partitioning via <i>n</i>-Level Recursive Bisection (Q5232546) (← links)
- Computing Top-<i>k</i> Closeness Centrality Faster in Unweighted Graphs (Q5232547) (← links)
- Computing Top-<i>k</i> Closeness Centrality in Fully-dynamic Graphs (Q5232720) (← links)
- Scaling up Group Closeness Maximization (Q5232740) (← links)
- Tree-Based Coarsening and Partitioning of Complex Networks (Q5266614) (← links)
- (Q5298934) (← links)
- (Q5298945) (← links)
- Analyzing Disturbed Diffusion on Networks (Q5459138) (← links)
- Approximating Betweenness Centrality in Fully Dynamic Networks (Q5856439) (← links)
- Approximation of the Diagonal of a Laplacian’s Pseudoinverse for Complex Network Analysis (Q5874469) (← links)
- High-quality hierarchical process mapping (Q6487599) (← links)
- Estimating current-flow closeness centrality with a multigrid Laplacian solver (Q6539143) (← links)
- Generic network sparsification via degree- and subgraph-based edge sampling (Q6576963) (← links)
