On the public citation graph
Distributed-Memory Algorithms for Maximum Cardinality Matching in Bipartite Graphs
0 signed · 51 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/978-3-642-40047-6_84openalex-snapshot
GPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs
inferredcites →https://doi.org/10.1016/0020-0190(85)90024-9openalex-snapshot
Depth-first search is inherently sequential
inferredcites →https://doi.org/10.1016/j.future.2003.07.011openalex-snapshot
Solving unsymmetric sparse systems of linear equations with PARDISO
inferredcites →https://doi.org/10.1016/j.parco.2011.09.004openalex-snapshot
Parallel algorithms for bipartite matching problems on distributed memory computers
inferredcites →https://doi.org/10.1016/j.parco.2014.03.004openalex-snapshot
On parallel push–relabel based algorithms for bipartite maximum matching
inferredcites →https://doi.org/10.1038/nature10011openalex-snapshot
Controllability of complex networks
inferredcites →https://doi.org/10.1109/71.642949openalex-snapshot
Efficient algorithms for all-to-all communications in multiport message-passing systems
inferredcites →https://doi.org/10.1109/cluster.2015.62openalex-snapshot
Distributed-Memory Algorithms for Maximal Cardinality Matching Using Matrix Algebra
inferredcites →https://doi.org/10.1109/ipdps.2012.82openalex-snapshot
Multithreaded Algorithms for Maxmum Matching in Bipartite Graphs
inferredcites →https://doi.org/10.1109/ipdps.2015.68openalex-snapshot
A Parallel Tree Grafting Algorithm for Maximum Cardinality Matching in Bipartite Graphs
inferredcites →https://doi.org/10.1109/mc.2015.215openalex-snapshot
Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures
inferredcites →https://doi.org/10.1109/sc.2005.4openalex-snapshot
A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L
inferredcites →https://doi.org/10.1109/sfcs.1981.21openalex-snapshot
Maximum matching in sparse random graphs
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1137/0221011openalex-snapshot
Using Interior-Point Methods for Fast Parallel Algorithms for Bipartite Matching and Related Problems
inferredcites →https://doi.org/10.1137/1.9781611972740.43openalex-snapshot
R-MAT: A Recursive Model for Graph Mining
inferredcites →https://doi.org/10.1145/1671970.1712656openalex-snapshot
Heuristic initialization for bipartite matching problems
inferredcites →https://doi.org/10.1145/1863482.1863493openalex-snapshot
Parallel greedy graph matching using an edge partitioning approach
inferredcites →https://doi.org/10.1145/2049662.2049663openalex-snapshot
The university of Florida sparse matrix collection
inferredcites →https://doi.org/10.1145/2049673.2049677openalex-snapshot
Design, implementation, and analysis of maximum transversal algorithms
inferredcites →https://doi.org/10.1145/2063384.2063471openalex-snapshot
Parallel breadth-first search on distributed memory systems
inferredcites →https://doi.org/10.1145/22145.22148openalex-snapshot
Constructing a perfect matching is in random NC
inferredcites →https://doi.org/10.1145/48014.61051openalex-snapshot
A new approach to the maximum-flow problem
inferredcites →https://doi.org/10.1145/98267.98287openalex-snapshot
Computing the block triangular form of a sparse matrix
inferredcites →https://doi.org/10.1177/1094342005051521openalex-snapshot
Optimization of Collective Communication Operations in MPICH
inferredcites →https://doi.org/10.1177/1094342011403516openalex-snapshot
The Combinatorial BLAS: design, implementation, and applications
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-60245-1_9openalex-snapshot
A Multi-threaded Algorithm for Capacity Constrained Assignment over Road Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-78713-4_16openalex-snapshot
iPUG: Accelerating Breadth-First Graph Traversals Using Manycore Graphcore IPUs
inferred← citeshttps://doi.org/10.1007/978-981-97-7752-5_20openalex-snapshot
Deterministic and Universal Truthful Mechanism for Fair Matching
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.1017/s0962492919000035openalex-snapshot
Approximation algorithms in combinatorial scientific computing
inferred← citeshttps://doi.org/10.1109/access.2019.2909283openalex-snapshot
Efficient Matching of Multi-Modal Sensing Nodes for Collaborative Sense Optimization of Composite Events
inferred← citeshttps://doi.org/10.1109/hpcc-dss-smartcity-dependsys57074.2022.00039openalex-snapshot
DTSpMV: An Adaptive SpMV Framework for Graph Analysis on GPUs
inferred← citeshttps://doi.org/10.1109/hpcs48598.2019.9188143openalex-snapshot
Introducing Streaming into Linear Algebra-based Sparse Graph Algorithms
inferred← citeshttps://doi.org/10.1109/ipdps.2017.76openalex-snapshot
A Work-Efficient Parallel Sparse Matrix-Sparse Vector Multiplication Algorithm
inferred← citeshttps://doi.org/10.1109/ipdps.2017.85openalex-snapshot
The Reverse Cuthill-McKee Algorithm in Distributed-Memory
inferred← citeshttps://doi.org/10.1109/ipdps64566.2025.00034openalex-snapshot
A Bidirectional GPU Algorithm for Computing Maximum Matchings in Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/ipdpsw.2017.118openalex-snapshot
Towards a GraphBLAS Library in Chapel
inferred← citeshttps://doi.org/10.1109/ipdpsw.2019.00053openalex-snapshot
LAGraph: A Community Effort to Collect Graph Algorithms Built on Top of the GraphBLAS
inferred← citeshttps://doi.org/10.1109/tpds.2016.2546258openalex-snapshot
Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting
inferred← citeshttps://doi.org/10.1109/tpds.2021.3094091openalex-snapshot
Combinatorial BLAS 2.0: Scaling Combinatorial Algorithms on Distributed-Memory Systems
inferred← citeshttps://doi.org/10.1145/3512770openalex-snapshot
fgSpMSpV: A Fine-grained Parallel SpMSpV Framework on HPC Platforms
inferred← citeshttps://doi.org/10.1145/3604606openalex-snapshot
A Survey of Accelerating Parallel Sparse Linear Algebra
inferred← citeshttps://doi.org/10.1145/3652579openalex-snapshot
Machine Learning-Based Kernel Selector for SpMV Optimization in Graph Analysis
inferred← citeshttps://doi.org/10.1177/10943420211029299openalex-snapshot
EXAGRAPH: Graph and combinatorial methods for enabling exascale applications
inferred← citeshttps://doi.org/10.13140/rg.2.2.10008.96002openalex-snapshot
A distributed memory, local configuration technique for re-configurable logic designs
inferred← citeshttps://doi.org/10.48550/arxiv.1610.08128openalex-snapshot
The Reverse Cuthill-McKee Algorithm in Distributed-Memory
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.