On the public citation graph
On the use of suboptimal matchings for scaling and ordering sparse symmetric matrices
0 signed · 35 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/nav.3800020109openalex-snapshot
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1002/net.3230130404openalex-snapshot
A survey of heuristics for the weighted matching problem
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/3-540-63165-8_161openalex-snapshot
LEDA: a platform for combinatorial and geometric computing
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.1007/s10589-006-9003-yopenalex-snapshot
Matching-based preprocessing algorithms to the solution of saddle-point problems in large-scale nonconvex interior-point optimization
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.2012.09.001openalex-snapshot
An auction-based weighted matching implementation on massively parallel architectures
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.1016/s0898-1221(00)90217-7openalex-snapshot
LEDA: A platform for combinatorial and geometric computing
inferredcites →https://doi.org/10.1109/cdc.1985.268826openalex-snapshot
A distributed asynchronous relaxation algorithm for the assignment problem
inferredcites →https://doi.org/10.1109/ipdps.2012.82openalex-snapshot
Multithreaded Algorithms for Maxmum Matching in Bipartite Graphs
inferredcites →https://doi.org/10.1137/04061043xopenalex-snapshot
Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
inferredcites →https://doi.org/10.1137/040615614openalex-snapshot
Weighted Matchings for Preconditioning Symmetric Indefinite Linear Systems
inferredcites →https://doi.org/10.1137/120884262openalex-snapshot
Optimal Weighted Matchings for Rank-Deficient 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.1145/2049662.2049663openalex-snapshot
The university of Florida sparse matrix collection
inferredcites →https://doi.org/10.1145/2513109.2513113openalex-snapshot
Pivoting strategies for tough sparse indefinite systems
inferredcites →https://doi.org/10.1177/1094342012452893openalex-snapshot
Approximate weighted matching on emerging manycore and multithreaded architectures
inferredcites →https://doi.org/10.3390/a6040702openalex-snapshot
New Parallel Sparse Direct Solvers for Multicore Architectures
inferredcites →https://doi.org/10.5286/raltr.2008007openalex-snapshot
The effects of scalings on the performance of a sparse symmetric indefinite solver
inferredcites →https://doi.org/10.5286/raltr.2011024openalex-snapshot
HSL_MA97 : a bit-compatible multifrontal code for sparse symmetric systems
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.2269openalex-snapshot
Improving solve time of aggregation‐based adaptive AMG
inferred← citeshttps://doi.org/10.1007/978-3-319-73441-5_62openalex-snapshot
Parallel Aggregation Based on Compatible Weighted Matching for AMG
inferred← citeshttps://doi.org/10.1007/978-3-319-93061-9_7openalex-snapshot
Green Neighbourhoods: The Role of Big Data in Low Voltage Networks’ Planning
inferred← citeshttps://doi.org/10.1017/s0962492919000035openalex-snapshot
Approximation algorithms in combinatorial scientific computing
inferred← citeshttps://doi.org/10.1109/lra.2025.3547675openalex-snapshot
Localized Coverage Planning for a Heat Transfer Tube Inspection Robot
inferred← citeshttps://doi.org/10.1137/18m1189348openalex-snapshot
A Distributed-Memory Algorithm for Computing a Heavy-Weight Perfect Matching on Bipartite Graphs
inferred← citeshttps://doi.org/10.1145/3545008.3545035openalex-snapshot
Highly Parallel Linear Forest Extraction from a Weighted Graph on GPUs
inferred← citeshttps://doi.org/10.26083/tuprints-00017951openalex-snapshot
Irregularity mitigation and portability abstractions for accelerated sparse matrix factorization
inferred← citeshttps://doi.org/10.5753/wscad.2015.14277openalex-snapshot
Impacto de estratégias combinatórias no precondicionador paralelo híbrido SPIKE
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.