On the public citation graph

JOSTLE - Multilevel Graph Partitioning Software: An Overview

https://doi.org/10.4203/csets.17.2

0 signed · 56 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.

Claim with ORCID

Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.

See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/cpe.5412openalex-snapshot

Dynamic mesh re‐partitioning considering iterative convergence rate for multiphase flows in OpenFOAM

inferred← citeshttps://doi.org/10.1007/978-3-030-05051-1_17openalex-snapshot

TAMM: A New Topology-Aware Mapping Method for Parallel Applications on the Tianhe-2A Supercomputer

inferred← citeshttps://doi.org/10.1007/978-3-030-47956-5_16openalex-snapshot

FFMK: A Fast and Fault-Tolerant Microkernel-Based System for Exascale Computing

inferred← citeshttps://doi.org/10.1007/978-3-030-64616-5_6openalex-snapshot

Optimization of Load Balancing Algorithms in Parallel Modeling of Objects Using a Large Number of Grids

inferred← citeshttps://doi.org/10.1007/978-3-030-85665-6_11openalex-snapshot

An MPI-based Algorithm for Mapping Complex Networks onto Hierarchical Architectures

inferred← citeshttps://doi.org/10.1007/978-3-319-40528-5_18openalex-snapshot

FFMK: A Fast and Fault-Tolerant Microkernel-Based System for Exascale Computing

inferred← citeshttps://doi.org/10.1007/978-3-319-42902-1_30openalex-snapshot

Map Partitioning for Accelerated Routing: Measuring Relation Between Tiled and Routing Partitions

inferred← citeshttps://doi.org/10.1007/978-3-319-49487-6_4openalex-snapshot

Recent Advances in Graph Partitioning

inferred← citeshttps://doi.org/10.1007/978-3-319-96983-1_47openalex-snapshot

High-Quality Shared-Memory Graph Partitioning

inferred← citeshttps://doi.org/10.1007/978-3-642-14081-5_2openalex-snapshot

Improved Algebraic Cryptanalysis of QUAD, Bivium and Trivium via Graph Partitioning on Equation Systems

inferred← citeshttps://doi.org/10.1007/978-3-642-15775-2_24openalex-snapshot

n-Level Graph Partitioning

inferred← citeshttps://doi.org/10.1007/978-3-642-19595-2_17openalex-snapshot

Parallel Graph Partitioning on Multicore Architectures

inferred← citeshttps://doi.org/10.1007/978-3-642-23719-5_40openalex-snapshot

Engineering Multilevel Graph Partitioning Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-642-30671-6_6openalex-snapshot

Hybrid Metaheuristics for the Graph Partitioning Problem

inferred← citeshttps://doi.org/10.1007/978-3-642-30850-5_3openalex-snapshot

Engineering Graph Partitioning Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-642-38527-8_16openalex-snapshot

Think Locally, Act Globally: Highly Balanced Graph Partitioning

inferred← citeshttps://doi.org/10.1007/978-981-10-6893-5_20openalex-snapshot

The Impact of the Mesh Partitioning Factors on CFD Simulation

inferred← citeshttps://doi.org/10.1007/978-981-32-9690-9_23openalex-snapshot

Geometric Multi-Way Frequent Subgraph Mining Approach to a Single Large Database

inferred← citeshttps://doi.org/10.1007/s00366-011-0218-xopenalex-snapshot

Tools to support mesh adaptation on massively parallel computers

inferred← citeshttps://doi.org/10.1007/s00450-009-0071-yopenalex-snapshot

Architecture aware parallelization of solvers for PDE systems on geometrical graphs

inferred← citeshttps://doi.org/10.1007/s10107-014-0811-zopenalex-snapshot

An exact combinatorial algorithm for minimum graph bisection

inferred← citeshttps://doi.org/10.1007/s10732-016-9315-8openalex-snapshot

Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering

inferred← citeshttps://doi.org/10.1007/s10732-020-09448-8openalex-snapshot

Evolutionary multi-level acyclic graph partitioning

inferred← citeshttps://doi.org/10.1007/s40314-017-0541-yopenalex-snapshot

An overlapping domain decomposition method for large-scale problems

inferred← citeshttps://doi.org/10.1080/17445760.2023.2174540openalex-snapshot

VSCT algorithm for graph partitioning based on volume, size, cuts and time

inferred← citeshttps://doi.org/10.1090/conm/588/11700openalex-snapshot

High quality graph partitioning

inferred← citeshttps://doi.org/10.1098/rsif.2020.0126openalex-snapshot

Computing and optimizing over all fixed-points of discrete systems on large networks

inferred← citeshttps://doi.org/10.1109/access.2020.2987355openalex-snapshot

Label Propagation-Based Parallel Graph Partitioning for Large-Scale Graph Data

inferred← citeshttps://doi.org/10.1109/access.2022.3219422openalex-snapshot

Graph Computing Systems and Partitioning Techniques: A Survey

inferred← citeshttps://doi.org/10.1109/admit57209.2022.00022openalex-snapshot

Enumeration of graph partitions into connected components

inferred← citeshttps://doi.org/10.1109/cluster.2013.6702677openalex-snapshot

Design of network topology aware scheduling services for large InfiniBand clusters

inferred← citeshttps://doi.org/10.1109/focs.2010.70openalex-snapshot

Approximating Maximum Weight Matching in Near-Linear Time

inferred← citeshttps://doi.org/10.1109/hpcsim.2016.7568334openalex-snapshot

Metis-CIC: A new mesh partitioning heuristic for parallel preconditioned iterative methods in CFD

inferred← citeshttps://doi.org/10.1109/hpec49654.2021.9622831openalex-snapshot

Spectral Graph Partitioning Using Geodesic Distance-based Projection

inferred← citeshttps://doi.org/10.1109/iccons.2018.8662954openalex-snapshot

A Review: Scalable Parallel Graph Partitioning for Complex Networks

inferred← citeshttps://doi.org/10.1109/ipdps.2010.5470485openalex-snapshot

Engineering a scalable high quality graph partitioner

inferred← citeshttps://doi.org/10.1109/ipdps.2011.108openalex-snapshot

Graph Partitioning with Natural Cuts

inferred← citeshttps://doi.org/10.1109/ipdps.2015.18openalex-snapshot

Parallel Graph Partitioning for Complex Networks

inferred← citeshttps://doi.org/10.1109/ipdpsw.2016.16openalex-snapshot

Parallel Graph Partitioning on a CPU-GPU Architecture

inferred← citeshttps://doi.org/10.1109/nsyss.2015.7043513openalex-snapshot

FGPGA: An efficient genetic approach for producing feasible graph partitions

inferred← citeshttps://doi.org/10.1109/sc.2012.47openalex-snapshot

Design of a scalable InfiniBand topology service to enable network-topology-aware placement of processes

inferred← citeshttps://doi.org/10.1109/ssci.2016.7849930openalex-snapshot

Evolving Multi-level Graph Partitioning Algorithms

inferred← citeshttps://doi.org/10.1109/tdsc.2017.2652469openalex-snapshot

Evolving Bipartite Authentication Graph Partitions

inferred← citeshttps://doi.org/10.1109/tpds.2022.3151194openalex-snapshot

GraphOpt: Constrained-Optimization-Based Parallelization of Irregular Graphs

inferred← citeshttps://doi.org/10.1109/tpds.2024.3501292openalex-snapshot

Two-Dimensional Balanced Partitioning and Efficient Caching for Distributed Graph Analysis

inferred← citeshttps://doi.org/10.1137/20m1333055openalex-snapshot

Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance

inferred← citeshttps://doi.org/10.1145/3582016.3582034openalex-snapshot

RepCut: Superlinear Parallel RTL Simulation with Replication-Aided Partitioning

inferred← citeshttps://doi.org/10.1631/fitee.1900075openalex-snapshot

OHTMA: an optimized heuristic topology-aware mapping algorithm on the Tianhe-3 exascale supercomputer prototype

inferred← citeshttps://doi.org/10.20948/prepr-2020-2openalex-snapshot

Survey of graph partitioning algorithms

inferred← citeshttps://doi.org/10.30958/ajte.8-2-3openalex-snapshot

ANumerical Uncertainty in Parallel Processing Using Computational Fluid Dynamics as Example

inferred← citeshttps://doi.org/10.30958/ajte_v8i2openalex-snapshot

inferred← citeshttps://doi.org/10.32657/10356/42376openalex-snapshot

Parallel strategies for reduced number of processors applied for CFD simulations on workstations

inferred← citeshttps://doi.org/10.5194/gmd-15-6025-2022openalex-snapshot

Parallel implementation of the SHYFEM (System of HydrodYnamic Finite Element Modules) model

inferred← citeshttps://doi.org/10.5555/2388996.2389091openalex-snapshot

Design of a scalable InfiniBand topology service to enable network-topology-aware placement of processes

inferred← citeshttps://doi.org/10.70675/a5e4eb69zfccbz4533z8af2zef989bf26acaopenalex-snapshot

Modeling of liquid film and breakup phenomena in Large-Eddy Simulations of aeroengines fueled by airblast atomizers

inferred← citeshttps://doi.org/10.70675/dcf4ccbaz8e48z46aeza2f6z6ad0d5f0d165openalex-snapshot

Développement et validation du formalisme Euler-Lagrange dans un solveur parallèle et non-structuré pour la simulation aux grandes échelles

Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.