On the public citation graph
A Parallel Tree Grafting Algorithm for Maximum Cardinality Matching in Bipartite Graphs
0 signed · 34 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.1016/0024-3795(93)90121-4openalex-snapshot
Predicting the structure of sparse orthogonal factors
inferredcites →https://doi.org/10.1016/j.cor.2012.12.009openalex-snapshot
Push-relabel based algorithms for the maximum transversal problem
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.1109/ipdps.2012.82openalex-snapshot
Multithreaded Algorithms for Maxmum Matching in Bipartite Graphs
inferredcites →https://doi.org/10.1109/ipdpsw.2012.310openalex-snapshot
Multithreaded Algorithms for Matching in Graphs with Application to Data Analysis in Flow Cytometry
inferredcites →https://doi.org/10.1109/ipdpsw.2013.159openalex-snapshot
Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search
inferredcites →https://doi.org/10.1109/mcse.2013.95openalex-snapshot
Exascale Computing Trends: Adjusting to the "New Normal"' for Computer Architecture
inferredcites →https://doi.org/10.1109/sc.2010.46openalex-snapshot
Scalable Graph Exploration on Multicore Processors
inferredcites →https://doi.org/10.1109/sfcs.1981.21openalex-snapshot
Maximum matching in sparse random graphs
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
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/1671970.1712656openalex-snapshot
Heuristic initialization for bipartite matching problems
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/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.1155/2013/702694openalex-snapshot
Direction-Optimizing Breadth-First Search
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
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-17642-6_16openalex-snapshot
A Dynamic Service Adaptation Algorithm for Seamless Integration of Cloud Infrastructure and Edge Devices
inferred← citeshttps://doi.org/10.1016/j.ins.2020.03.020openalex-snapshot
tpSpMV: A two-phase large-scale sparse matrix-vector multiplication kernel for manycore architectures
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/iiswc66894.2025.00030openalex-snapshot
ALPHA-PIM: Analysis of Linear Algebraic Processing for High-Performance Graph Applications on a Real Processing-In-Memory System
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/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.1145/3472456.3472479openalex-snapshot
Regu2D: Accelerating Vectorization of SpMV on Intel Processors through 2D-partitioning and Regular Arrangement
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.