On the public citation graph
A parallel graph partitioning algorithm for a message-passing multiprocessor
0 signed · 97 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/j.1538-7305.1970.tb01770.xopenalex-snapshot
An Efficient Heuristic Procedure for Partitioning Graphs
inferredcites →https://doi.org/10.1002/nme.1620140606openalex-snapshot
A comparasion of three resequencing algorithms for the reduction of matrix profile and wavefront
inferredcites →https://doi.org/10.1007/bf01396660openalex-snapshot
The analysis of a nested dissection algorithm
inferredcites →https://doi.org/10.1016/0167-8191(86)90014-1openalex-snapshot
Computational models and task scheduling for parallel sparse Cholesky factorization
inferredcites →https://doi.org/10.1016/0167-8191(88)90039-7openalex-snapshot
A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
inferredcites →https://doi.org/10.1016/0167-8191(89)90101-4openalex-snapshot
Communication results for parallel sparse Cholesky factorization on a hypercube
inferredcites →https://doi.org/10.1016/s0167-8191(84)90446-0openalex-snapshot
Parallel pivoting algorithms for sparse symmetric matrices
inferredcites →https://doi.org/10.1109/c-m.1981.220290openalex-snapshot
A Survey of Interconnection Networks
inferredcites →https://doi.org/10.1109/dac.1982.1585498openalex-snapshot
A Linear-Time Heuristic for Improving Network Partitions
inferredcites →https://doi.org/10.1137/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0209046openalex-snapshot
Applications of a Planar Separator Theorem
inferredcites →https://doi.org/10.1137/0715069openalex-snapshot
An Automatic Nested Dissection Algorithm for Irregular Finite Element Problems
inferredcites →https://doi.org/10.1137/0909021openalex-snapshot
Sparse Cholesky Factorization on a Local-Memory Multiprocessor
inferredcites →https://doi.org/10.1137/0909029openalex-snapshot
Equivalent Sparse Matrix Reordering by Elimination Tree Rotations
inferredcites →https://doi.org/10.2172/5760616openalex-snapshot
Message-passing multiprocessor simulator
inferredcites →https://doi.org/10.2307/2007640openalex-snapshot
Computer Solution of Large Sparse Positive Definite Systems.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jpdc.1997.1404openalex-snapshot
Multilevelk-way Partitioning Scheme for Irregular Graphs
inferred← citeshttps://doi.org/10.1007/3-540-18991-2_30openalex-snapshot
The mapping of applications to multiple bus and Banyan interconnected multiprocessor systems: A case study
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_17openalex-snapshot
Parallel solution of sparse linear systems
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_52openalex-snapshot
The analysis of local search problems and their heuristics
inferred← citeshttps://doi.org/10.1007/978-1-4613-8369-7_2openalex-snapshot
Cutting down on Fill Using Nested Dissection: Provably Good Elimination Orderings
inferred← citeshttps://doi.org/10.1007/978-1-4615-1337-7_10openalex-snapshot
Sparse Equation Solver with Unrolling Strategies
inferred← citeshttps://doi.org/10.1007/978-3-030-89803-8_7openalex-snapshot
A Non-centralized Control Scheme Based on Online Partitioning
inferred← citeshttps://doi.org/10.1007/978-3-642-77382-2_1openalex-snapshot
Parallel Genetic Algorithms in Optimization
inferred← citeshttps://doi.org/10.1007/978-3-662-48096-0_27openalex-snapshot
DFEP: Distributed Funding-Based Edge Partitioning
inferred← citeshttps://doi.org/10.1007/978-94-011-5412-3_12openalex-snapshot
Graph Partitioning Algorithms with Applications to Scientific Computing
inferred← citeshttps://doi.org/10.1007/bf01407861openalex-snapshot
Task scheduling for parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1007/bfb0029748openalex-snapshot
Partitioning a graph with a parallel genetic algorithm
inferred← citeshttps://doi.org/10.1007/pl00009250openalex-snapshot
Separators in Graphs with Negative and Multiple Vertex Weights
inferred← citeshttps://doi.org/10.1007/s10589-017-9945-2openalex-snapshot
A multilevel bilinear programming algorithm for the vertex separator problem
inferred← citeshttps://doi.org/10.1016/0166-218x(93)e0166-vopenalex-snapshot
Approximation techniques for hypergraph partitioning problems
inferred← citeshttps://doi.org/10.1016/0167-8191(88)90039-7openalex-snapshot
A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor
inferred← citeshttps://doi.org/10.1016/0743-7315(91)90106-jopenalex-snapshot
A comparative performance analysis of mapping applications to parallel multiprocessor systems: A case study
inferred← citeshttps://doi.org/10.1016/b978-0-08-040806-4.50034-4openalex-snapshot
PARALLEL GENETIC ALGORITHMS IN COMBINATORIAL OPTIMIZATION
inferred← citeshttps://doi.org/10.1016/j.jcp.2011.05.027openalex-snapshot
Extension and optimization of the FIND algorithm: Computing Green’s and less-than Green’s functions
inferred← citeshttps://doi.org/10.1016/j.jcp.2013.01.036openalex-snapshot
A fast algorithm for sparse matrix computations related to inversion
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2018.10.038openalex-snapshot
Online partitioning method for decentralized control of linear switching large-scale systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2012.01.004openalex-snapshot
Replicated partitioning for undirected hypergraphs
inferred← citeshttps://doi.org/10.1016/s0020-0255(98)10005-1openalex-snapshot
Partitioning graphs on message-passing machines by pairwise mincut
inferred← citeshttps://doi.org/10.1016/s0167-8191(00)00046-6openalex-snapshot
Parallel optimisation algorithms for multilevel mesh partitioning
inferred← citeshttps://doi.org/10.1016/s0167-8191(97)00018-5openalex-snapshot
Parallel ordering using edge contraction
inferred← citeshttps://doi.org/10.1016/s0167-8191(99)00077-0openalex-snapshot
Developments and trends in the parallel solution of linear systems
inferred← citeshttps://doi.org/10.1016/s0378-7796(02)00042-1openalex-snapshot
An on-line distributed intelligent fault section estimation system for large-scale power networks
inferred← citeshttps://doi.org/10.1016/s0965-9978(98)00013-1openalex-snapshot
A parallel variant of simulated annealing for optimizing mesh partitions on workstations
inferred← citeshttps://doi.org/10.1016/s1570-8659(00)07002-2openalex-snapshot
Gaussian elimination for the solution of linear systems of equations
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1023/a:1008117625893openalex-snapshot
A Prefix Code Matching Parallel Load-Balancing Method for Solution-Adaptive Unstructured Finite Element Graphs on Distributed Memory Multicomputers
inferred← citeshttps://doi.org/10.1061/(asce)cp.1943-5487.0000220openalex-snapshot
Finding All-Pairs Shortest Path for a Large-Scale Transportation Network Using Parallel Floyd-Warshall and Parallel Dijkstra Algorithms
inferred← citeshttps://doi.org/10.1080/02533839.2001.9670618openalex-snapshot
A binomial tree based parallel load‐balancing method for solution‐adaptive finite element graphs on distributed memory multicomputers
inferred← citeshttps://doi.org/10.1093/oso/9780198500148.003.0002openalex-snapshot
Sparse Numerical Linear Algebra: Direct Methods and Preconditioning
inferred← citeshttps://doi.org/10.1109/43.144852openalex-snapshot
An efficient eigenvector approach for finding netlist partitions
inferred← citeshttps://doi.org/10.1109/71.762816openalex-snapshot
Tree-based parallel load-balancing methods for solution-adaptive finite element graphs on distributed memory multicomputers
inferred← citeshttps://doi.org/10.1109/74.370594openalex-snapshot
Review of domain-decomposition methods for the implementation of FEM on massively parallel computers
inferred← citeshttps://doi.org/10.1109/bigdata.2014.7004243openalex-snapshot
Synergistic partitioning in multiple large scale social networks
inferred← citeshttps://doi.org/10.1109/focs.2011.15openalex-snapshot
Separator Theorems for Minor-Free and Shallow Minor-Free Graphs with Applications
inferred← citeshttps://doi.org/10.1109/icacci.2017.8125836openalex-snapshot
Accelerated kerninghan lin algorithm for graph partitioning
inferred← citeshttps://doi.org/10.1109/icapp.1996.562856openalex-snapshot
Mapping parallel programs onto hypercube computers to minimize link-contention degree
inferred← citeshttps://doi.org/10.1109/iccitechn.2007.4579390openalex-snapshot
A dynamic load balancing approach for solution adaptive finite element graph applications on distributed systems
inferred← citeshttps://doi.org/10.1109/iccsp.2017.8286727openalex-snapshot
VLSI partitioning using parallel kernighan lin algorithm
inferred← citeshttps://doi.org/10.1109/icnc.2008.523openalex-snapshot
A New Islanding Boundary Searching Approach Based on Slow Coherency and Graph Theoretic
inferred← citeshttps://doi.org/10.1109/icpp.1998.708524openalex-snapshot
A prefix code matching parallel load-balancing method for solution-adaptive unstructured finite element graphs on distributed memory multicomputers
inferred← citeshttps://doi.org/10.1109/ipdps.2012.64openalex-snapshot
ShyLU: A Hybrid-Hybrid Solver for Multicore Platforms
inferred← citeshttps://doi.org/10.1109/ipdpsw.2015.17openalex-snapshot
K-Ways Partitioning of Polyhedral Process Networks: A Multi-level Approach
inferred← citeshttps://doi.org/10.1109/ipps.1996.508075openalex-snapshot
Parallel multilevel graph partitioning
inferred← citeshttps://doi.org/10.1109/nas51552.2021.9605433openalex-snapshot
GO: Out-Of-Core Partitioning of Large Irregular Graphs
inferred← citeshttps://doi.org/10.1109/sc.2002.10045openalex-snapshot
Implementing the MPI Process Topology Mechanism
inferred← citeshttps://doi.org/10.1109/shpcc.1994.296723openalex-snapshot
A reordering and mapping algorithm for parallel sparse Cholesky factorization
inferred← citeshttps://doi.org/10.1109/spdp.1991.218254openalex-snapshot
Asynchronous parallel search by the parallel genetic algorithm
inferred← citeshttps://doi.org/10.1109/tc.2023.3290494openalex-snapshot
Towards Optimal Application Offloading in Heterogeneous Edge-Cloud Computing
inferred← citeshttps://doi.org/10.1109/tdc.2001.971236openalex-snapshot
Minimum degree reordering based graph partitioning method for distributed fault section estimation system in power networks
inferred← citeshttps://doi.org/10.1137/0611030openalex-snapshot
Partitioning Sparse Matrices with Eigenvectors of Graphs
inferred← citeshttps://doi.org/10.1137/0910069openalex-snapshot
The Minimum Degree Ordering with Constraints
inferred← citeshttps://doi.org/10.1137/0912063openalex-snapshot
Limiting Communication in Parallel Sparse Cholesky Factorization
inferred← citeshttps://doi.org/10.1137/0916085openalex-snapshot
Distributed Sparse Gaussian Elimination and Orthogonal Factorization
inferred← citeshttps://doi.org/10.1137/1033099openalex-snapshot
Parallel Algorithms for Sparse Linear Systems
inferred← citeshttps://doi.org/10.1137/s0895479892238270openalex-snapshot
A Cartesian Parallel Nested Dissection Algorithm
inferred← citeshttps://doi.org/10.1137/s1064827595287997openalex-snapshot
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
inferred← citeshttps://doi.org/10.1145/158459.158465openalex-snapshot
On a parallel partitioning technique for use with conservative parallel simulation
inferred← citeshttps://doi.org/10.1145/174134.158465openalex-snapshot
On a parallel partitioning technique for use with conservative parallel simulation
inferred← citeshttps://doi.org/10.1145/2063384.2063469openalex-snapshot
A scalable eigensolver for large scale-free graphs using 2D graph partitioning
inferred← citeshttps://doi.org/10.1145/224170.224228openalex-snapshot
A multilevel algorithm for partitioning graphs
inferred← citeshttps://doi.org/10.1145/318789.318820openalex-snapshot
Data traffic reduction schemes for Cholesky factorization on asynchronous multiprocessor systems
inferred← citeshttps://doi.org/10.1145/369028.369103openalex-snapshot
Parallel multilevel k-way partitioning scheme for irregular graphs
inferred← citeshttps://doi.org/10.1145/66888.66890openalex-snapshot
A graph partitioning algorithm by node separators
inferred← citeshttps://doi.org/10.1145/98267.98287openalex-snapshot
Computing the block triangular form of a sparse matrix
inferred← citeshttps://doi.org/10.1177/0037549706075479openalex-snapshot
Cost-based Partitioning for Distributed and Parallel Simulation of Decomposable Multiscale Constructive Models
inferred← citeshttps://doi.org/10.1177/109434209500900403openalex-snapshot
A Localized Algorithm for Optimizing Unstructured Mesh Partitions
inferred← citeshttps://doi.org/10.13140/rg.2.2.15213.82400openalex-snapshot
Detección de comunidades en redes: Algoritmos y aplicaciones
inferred← citeshttps://doi.org/10.1371/journal.pone.0152250openalex-snapshot
Developing Subdomain Allocation Algorithms Based on Spatial and Communicational Constraints to Accelerate Dust Storm Simulation
inferred← citeshttps://doi.org/10.15168/11572_368736openalex-snapshot
Distributed Computing for Large-scale Graphs
inferred← citeshttps://doi.org/10.2172/1018444openalex-snapshot
A Novel Coarsening Method for Scalable and Efficient Mesh Generation
inferred← citeshttps://doi.org/10.3390/electronics10161930openalex-snapshot
Multi-Tier 3D IC Physical Design with Analytical Quadratic Partitioning Algorithm Using 2D P&R Tool
inferred← citeshttps://doi.org/10.48550/arxiv.1403.6270openalex-snapshot
Distributed Edge Partitioning for Graph Processing
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.