JOSTLE

swMATH4985MaRDI QIDQ17132FDOQ17132

Author name not available (Why is that?)

Official website: http://staffweb.cms.gre.ac.uk/~wc06/jostle/

Cited In (58)

• A new graph representation for cable-membrane structures
• DistDLB: improving cosmology SAMR simulations on distributed computing systems through hierarchical load balancing
• An exact combinatorial algorithm for minimum graph bisection
• Optimizing streaming graph partitioning via a heuristic greedy method and caching strategy
• Adaptive atmospheric modeling. Key techniques in grid generation, data structures, and numerical operations with applications
• Cell-vertex Based Parallel and Adaptive Explicit 3D Flow Solution on Unstructured Grids
• Local expansion concepts for detecting transport barriers in dynamical systems
• Title not available (Why is that?)
• Discovering bipartite substructure in directed networks
• Algebraic multigrid methods for Laplacians of graphs
• The implementation of an aeronautical CFD flow code onto distributed memory parallel systems
• A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms
• A Tutorial on Elliptic PDE Solvers and Their Parallelization
• Linear-time approximation for maximum weight matching
• Title not available (Why is that?)
• Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
• CAPLib
• SNAP
• Black Box Opt
• PHAML
• KaFFPa
• Bubble-FOS/C
• Scotch
• DibaP
• Chaco
• MC73
• GraphLab
• DryadOpt
• Partitioning and dynamic load balancing for the numerical solution of partial differential equations
• New challenges in dynamic load balancing
• GADS
• PLUM
• CAPTools
• KaHIP
• kMetis
• SCLaP
• PARTY
• SAUNA
• Graph partitioning using matrix values for preconditioning symmetric positive definite systems
• Upper bounds on the bisection width of 3- and 4-regular graphs
• LocalGraphClustering
• PushRelabelMaxFlow
• Python-Louvain
• Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
• A dynamic diffusion optimization method for irregular finite element graph partitioning
• An overlapping domain decomposition method for large-scale problems
• Title not available (Why is that?)
• First- and second-order diffusive methods for rapid, coarse, distributed load balancing
• Title not available (Why is that?)
• Unstructured grid adaptation for multiscale finite volume method
• A novel dynamic load balancing scheme for parallel systems.
• Parallel Implementation of DSMC Using Unstructured Mesh
• 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
• Parallel mesh-partitioning algorithms for generating shape optimised partitions using evolutionary computing
• Advanced coarsening schemes for graph partitioning
• A prefix code matching parallel load-balancing method for solution-adaptive unstructured finite element graphs on distributed memory multicomputers
• Finding optimal solutions to the graph partitioning problem with heuristic search
• Disturbed diffusive processes for solving partitioning problems on graphs

This page was built for software: JOSTLE