On the public citation graph
Distributed-Memory Parallel Algorithms for Matching and Coloring
0 signed · 42 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.1007/3-540-49116-3_24openalex-snapshot
Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs
inferredcites →https://doi.org/10.1007/978-3-540-68111-3_74openalex-snapshot
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
inferredcites →https://doi.org/10.1016/0167-8191(94)90004-3openalex-snapshot
Scalable iterative solution of sparse linear systems
inferredcites →https://doi.org/10.1016/j.jpdc.2007.08.002openalex-snapshot
A framework for scalable greedy coloring on distributed-memory parallel computers
inferredcites →https://doi.org/10.1109/csb.2004.1332441openalex-snapshot
High-throughput 3D structural homology detection via NMR resonance assignment
inferredcites →https://doi.org/10.1137/0917054openalex-snapshot
ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
inferredcites →https://doi.org/10.1137/s0036144504444711openalex-snapshot
What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
inferredcites →https://doi.org/10.1137/s0895479897317661openalex-snapshot
The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
inferredcites →https://doi.org/10.1137/s0895479899358443openalex-snapshot
On Algorithms For Permuting Large Entries to the Diagonal of a Sparse Matrix
inferredcites →https://doi.org/10.1137/s1064827595287997openalex-snapshot
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
inferredcites →https://doi.org/10.1142/s0129626407002843openalex-snapshot
CHALLENGES IN PARALLEL GRAPH PROCESSING
inferredcites →https://doi.org/10.1145/1284320.1284321openalex-snapshot
AdWords and generalized online matching
inferredcites →https://doi.org/10.1145/1863482.1863493openalex-snapshot
Parallel greedy graph matching using an edge partitioning approach
inferredcites →https://doi.org/10.1145/98267.98287openalex-snapshot
Computing the block triangular form of a sparse matrix
inferredcites →https://doi.org/10.25777/e1r5-yp32openalex-snapshot
Algorithms for Vertex-Weighted Matching in Graphs
inferredcites →https://doi.org/10.48550/arxiv.cs/0410047openalex-snapshot
Simple Distributed Weighted Matchings
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s11227-024-05989-yopenalex-snapshot
Alya toward exascale: algorithmic scalability using PSCToolkit
inferred← citeshttps://doi.org/10.1016/j.cogsys.2018.08.008openalex-snapshot
Graph matching approach and generalized median graph for automatic labeling of cortical sulci with parallel and distributed algorithms
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.11.033openalex-snapshot
Parallel computational optimization in operations research: A new integrative framework, literature review and research directions
inferred← citeshttps://doi.org/10.1016/j.jpdc.2013.12.010openalex-snapshot
Fast parallel algorithms for graph similarity and matching
inferred← citeshttps://doi.org/10.1016/j.parco.2011.09.004openalex-snapshot
Parallel algorithms for bipartite matching problems on distributed memory computers
inferred← citeshttps://doi.org/10.1016/j.parco.2012.09.001openalex-snapshot
An auction-based weighted matching implementation on massively parallel architectures
inferred← citeshttps://doi.org/10.1016/j.parco.2016.05.007openalex-snapshot
A matrix-algebraic formulation of distributed-memory maximal cardinality matching algorithms in bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.parco.2020.102734openalex-snapshot
Parallelization of network motif discovery using star contraction
inferred← citeshttps://doi.org/10.1109/cluster.2015.62openalex-snapshot
Distributed-Memory Algorithms for Maximal Cardinality Matching Using Matrix Algebra
inferred← citeshttps://doi.org/10.1109/ipdps.2012.81openalex-snapshot
Multithreaded Clustering for Multi-level Hypergraph Partitioning
inferred← citeshttps://doi.org/10.1109/ipdps.2012.82openalex-snapshot
Multithreaded Algorithms for Maxmum Matching in Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/ipdps.2014.117openalex-snapshot
Scaling Irregular Applications through Data Aggregation and Software Multithreading
inferred← citeshttps://doi.org/10.1109/ipdps.2014.61openalex-snapshot
New Effective Multithreaded Matching Algorithms
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00085openalex-snapshot
Exploring MPI Communication Models for Graph Applications Using Graph Matching as a Case Study
inferred← citeshttps://doi.org/10.1109/ipdpsw.2018.00104openalex-snapshot
Scalable b-Matching on GPUs
inferred← citeshttps://doi.org/10.1109/nas.2016.7549410openalex-snapshot
Modeling the Impact of Silicon Photonics on Graph Analytics
inferred← citeshttps://doi.org/10.1109/pdp59025.2023.00017openalex-snapshot
AMG Preconditioners based on Parallel Hybrid Coarsening and Multi-objective Graph Matching
inferred← citeshttps://doi.org/10.1109/sc.2012.8openalex-snapshot
A multithreaded algorithm for network alignment via approximate matching
inferred← citeshttps://doi.org/10.1109/sc41405.2020.00103openalex-snapshot
High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality
inferred← citeshttps://doi.org/10.1109/sc41406.2024.00024openalex-snapshot
Efficient Weighted Graph Matching on GPUs
inferred← citeshttps://doi.org/10.1109/tpds.2021.3101425openalex-snapshot
Characterizing Performance of Graph Neighborhood Communication Patterns
inferred← citeshttps://doi.org/10.1137/1.9781611974690.ch10openalex-snapshot
On Stable Marriages and Greedy Matchings
inferred← citeshttps://doi.org/10.1155/2012/713587openalex-snapshot
The Zoltan and Isorropia Parallel Toolkits for Combinatorial Scientific Computing: Partitioning, Ordering and Coloring
inferred← citeshttps://doi.org/10.5555/2388996.2389083openalex-snapshot
A multithreaded algorithm for network alignment via approximate matching
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95290openalex-snapshot
Scalable system software for high performance large-scale applications
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.