On the public citation graph
Multithreaded Algorithms for Maxmum Matching in Bipartite Graphs
0 signed · 49 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-540-68111-3_74openalex-snapshot
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem
inferredcites →https://doi.org/10.1007/bf00247653openalex-snapshot
Auction algorithms for network flow problems: A tutorial introduction
inferredcites →https://doi.org/10.1007/s10589-007-9146-5openalex-snapshot
Towards auction algorithms for large dense assignment problems
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/s0167-8191(05)80062-6openalex-snapshot
Parallel synchronous and asynchronous implementations of the auction algorithm
inferredcites →https://doi.org/10.1090/dimacs/012/19openalex-snapshot
The assignment problem on parallel architectures
inferredcites →https://doi.org/10.1093/oso/9780198501626.001.0001openalex-snapshot
Fast Parallel Algorithms for Graph Matching Problems
inferredcites →https://doi.org/10.1109/ipdps.2011.360openalex-snapshot
Distributed-Memory Parallel Algorithms for Matching and Coloring
inferredcites →https://doi.org/10.1109/pact.2009.22openalex-snapshot
Memory Performance and Cache Coherency Effects on an Intel Nehalem Multiprocessor System
inferredcites →https://doi.org/10.1137/0202019openalex-snapshot
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
inferredcites →https://doi.org/10.1145/12130.12144openalex-snapshot
A new approach to the maximum flow problem
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/2049673.2049677openalex-snapshot
Design, implementation, and analysis of maximum transversal algorithms
inferredcites →https://doi.org/10.1145/98267.98287openalex-snapshot
Computing the block triangular form of a sparse matrix
inferredcites →https://doi.org/10.1177/1094342012452893openalex-snapshot
Approximate weighted matching on emerging manycore and multithreaded architectures
inferredcites →https://doi.org/10.25777/e1r5-yp32openalex-snapshot
Algorithms for Vertex-Weighted Matching in Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nla.1978openalex-snapshot
On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices
inferred← citeshttps://doi.org/10.1007/978-3-032-21477-5_3openalex-snapshot
Incremental Critical Cells for Homology Characterization
inferred← citeshttps://doi.org/10.1007/978-3-642-40047-6_84openalex-snapshot
GPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs
inferred← citeshttps://doi.org/10.1016/j.jpdc.2015.06.009openalex-snapshot
Two approximation algorithms for bipartite matching on multicore architectures
inferred← citeshttps://doi.org/10.1016/j.parco.2014.03.004openalex-snapshot
On parallel push–relabel based algorithms for bipartite maximum 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.1016/j.parco.2017.06.003openalex-snapshot
Basker: Parallel sparse LU factorization utilizing hierarchical parallelism and data layouts
inferred← citeshttps://doi.org/10.1017/s0962492916000076openalex-snapshot
A survey of direct methods for sparse linear systems
inferred← citeshttps://doi.org/10.1109/bigdata.2015.7363856openalex-snapshot
Efficient distributed maximum matching for solving the container exchange problem in the maritime industry
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/icdmw69685.2025.00128openalex-snapshot
Computing Persistent Homology Using Discrete Morse Theory
inferred← citeshttps://doi.org/10.1109/icpp.2013.11openalex-snapshot
A Push-Relabel-Based Maximum Cardinality Bipartite Matching Algorithm on GPUs
inferred← citeshttps://doi.org/10.1109/ipdps.2014.63openalex-snapshot
Bipartite Matching Heuristics with Quality Guarantees on Shared Memory Parallel Computers
inferred← citeshttps://doi.org/10.1109/ipdps.2015.68openalex-snapshot
A Parallel Tree Grafting Algorithm for Maximum Cardinality Matching in Bipartite Graphs
inferred← citeshttps://doi.org/10.1109/ipdps.2016.103openalex-snapshot
Distributed-Memory Algorithms for Maximum Cardinality Matching in Bipartite Graphs
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.2012.310openalex-snapshot
Multithreaded Algorithms for Matching in Graphs with Application to Data Analysis in Flow Cytometry
inferred← citeshttps://doi.org/10.1109/ipdpsw.2014.155openalex-snapshot
Parallel Heuristics for Scalable Community Detection
inferred← citeshttps://doi.org/10.1109/ipdpsw63119.2024.00107openalex-snapshot
Shared-Memory Parallel Edmonds Blossom Algorithm for Maximum Cardinality Matching in General Graphs
inferred← citeshttps://doi.org/10.1109/jlt.2018.2883387openalex-snapshot
Effectively Reconfigure the Optical Circuit Switching Layer Topology in Data Center Network by OCBridge
inferred← citeshttps://doi.org/10.1109/mc.2015.215openalex-snapshot
Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures
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.1137/1.9781611975055.19openalex-snapshot
Scalable Kernelization for Maximum Independent Sets
inferred← citeshttps://doi.org/10.1137/17m1140029openalex-snapshot
A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs
inferred← citeshttps://doi.org/10.1155/2015/726274openalex-snapshot
Delay Minimization Topology Control in Planetary Surface Network: An Autonomous Systems Approach
inferred← citeshttps://doi.org/10.1364/oe.23.003563openalex-snapshot
Fully programmable and scalable optical switching fabric for petabyte data center
inferred← citeshttps://doi.org/10.14778/3748191.3748199openalex-snapshot
X-Blossom: Massive Parallelization of Graph Maximum Matching
inferred← citeshttps://doi.org/10.48550/arxiv.1501.03461openalex-snapshot
An Algorithmic Pipeline for Analyzing Multi-parametric Flow Cytometry Data
inferred← citeshttps://doi.org/10.70675/d183afb9z9c73z4321za674zcbf6bc4930c0openalex-snapshot
Contributions au co-design de noyaux irréguliers sur architectures manycore : cas du remaillage anisotrope multi-échelle en mécanique des fluides numérique
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.