On the public citation graph

On Seeded Subgraph-to-Subgraph Matching: The Sssgm Algorithm and Matchability Information Theory

https://doi.org/10.2139/ssrn.4794776
0 signed · 48 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/nav.3800020109openalex-extracted
The Hungarian method for the assignment problem
inferredcites →https://doi.org/10.1002/nav.3800030109openalex-extracted
An algorithm for quadratic programming
inferredcites →https://doi.org/10.1002/rsa.10054openalex-extracted
On the asymmetry of random regular graphs and random graphs
inferredcites →https://doi.org/10.1002/rsa.20934openalex-extracted
Seeded graph matching via large neighborhood statistics
inferredcites →https://doi.org/10.1007/bf02278710openalex-extracted
A shortest augmenting path algorithm for dense and sparse linear assignment problems
inferredcites →https://doi.org/10.1007/s41109-021-00398-zopenalex-extracted
The phantom alignment strength conjecture: practical use of graph matching alignment strength to indicate a meaningful graph match
inferredcites →https://doi.org/10.1016/j.disopt.2008.10.003openalex-extracted
The k -assignment polytope
inferredcites →https://doi.org/10.1016/j.ins.2016.01.074openalex-extracted
Fifty years of graph matching, network alignment and network comparison
inferredcites →https://doi.org/10.1016/j.patcog.2018.09.014openalex-extracted
Seeded graph matching
inferredcites →https://doi.org/10.1016/j.patcog.2020.107418openalex-extracted
Fast matching via ergodic markov chain for super-large graphs
inferredcites →https://doi.org/10.1016/j.patrec.2019.05.008openalex-extracted
Alignment strength and correlation for graphs
inferredcites →https://doi.org/10.1090/s0002-9939-1958-0095128-8openalex-extracted
The Convex Hull of Sub-Permutation Matrices
inferredcites →https://doi.org/10.1093/bioinformatics/btl287openalex-extracted
NetAlign: a web-based tool for comparison of protein interaction networks
inferredcites →https://doi.org/10.1093/bioinformatics/btp196openalex-extracted
Global alignment of protein–protein interaction networks by graph matching methods
inferredcites →https://doi.org/10.1093/bioinformatics/btp203openalex-extracted
IsoRankN: spectral methods for global alignment of multiple protein networks
inferredcites →https://doi.org/10.1093/bioinformatics/btt202openalex-extracted
NETAL: a new graph-based method for global alignment of protein–protein interaction networks
inferredcites →https://doi.org/10.1109/acssc.2017.8335178openalex-extracted
Seeded graph matching: Efficient algorithms and theoretical guarantees
inferredcites →https://doi.org/10.1109/bigdata.2018.8622566openalex-extracted
Filtering Methods for Subgraph Matching on Multiplex Networks
inferredcites →https://doi.org/10.1109/cisp-bmei51763.2020.9263681openalex-extracted
A Survey On Graph Matching In Computer Vision
inferredcites →https://doi.org/10.1109/cvpr.2012.6247667openalex-extracted
Factorized graph matching
inferredcites →https://doi.org/10.1109/cvpr42600.2020.01176openalex-extracted
Pose-Guided Visible Part Matching for Occluded Person ReID
inferredcites →https://doi.org/10.1109/iccv48922.2021.00624openalex-extracted
Learning to Match Features with Seeded Graph Matching Network
inferredcites →https://doi.org/10.1109/itw54588.2022.9965819openalex-extracted
Seeded Database Matching Under Noisy Column Repetitions
inferredcites →https://doi.org/10.1109/tit.2018.2808999openalex-extracted
Information Recovery in Shuffled Graphs via Graph Matching
inferredcites →https://doi.org/10.1109/tnse.2021.3056329openalex-extracted
Subgraph Matching on Multiplex Networks
inferredcites →https://doi.org/10.1109/tnse.2023.3236028openalex-extracted
Structural Equivalence in Subgraph Matching
inferredcites →https://doi.org/10.1109/tpami.2015.2424894openalex-extracted
Graph Matching: Relax at Your Own Risk
inferredcites →https://doi.org/10.1109/tpami.2019.2914651openalex-extracted
Matched Filters for Noisy Induced Subgraph Detection
inferredcites →https://doi.org/10.1142/s0218001404003228openalex-extracted
THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION
inferredcites →https://doi.org/10.1142/s0218001414500013openalex-extracted
GRAPH MATCHING AND LEARNING IN PATTERN RECOGNITION IN THE LAST 10 YEARS
inferredcites →https://doi.org/10.1145/2896377.2901460openalex-extracted
Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching
inferredcites →https://doi.org/10.1145/2897518.2897542openalex-extracted
Graph isomorphism in quasipolynomial time [extended abstract]
inferredcites →https://doi.org/10.1145/2939672.2939766openalex-extracted
FINAL
inferredcites →https://doi.org/10.1145/2964791.2901460openalex-extracted
Improved Achievability and Converse Bounds for Erdos-Renyi Graph Matching
inferredcites →https://doi.org/10.1145/3127876openalex-extracted
De-anonymizing Clustered Social Networks by Percolation Graph Matching
inferredcites →https://doi.org/10.1145/3269206.3271788openalex-extracted
REGAL
inferredcites →https://doi.org/10.1145/3366702openalex-extracted
Partial Recovery of Erdðs-Rényi Graph Alignment via k-Core Alignment
inferredcites →https://doi.org/10.1162/netn_a_00287openalex-extracted
Bisected graph matching improves automated pairing of bilaterally homologous neurons from connectomes
inferredcites →https://doi.org/10.1186/1471-2105-10-s1-s59openalex-extracted
A new graph-based method for pairwise global network alignment
inferredcites →https://doi.org/10.1287/opre.2022.2355openalex-extracted
Partial Recovery in the Graph Alignment Problem
inferredcites →https://doi.org/10.1371/journal.pone.0121002openalex-extracted
Fast Approximate Quadratic Programming for Graph Matching
inferredcites →https://doi.org/10.14778/2311906.2311907openalex-extracted
Efficient subgraph matching on billion node graphs
inferredcites →https://doi.org/10.48550/arxiv.1401.3813openalex-extracted
Seeded Graph Matching Via Joint Optimization of Fidelity and Commensurability
inferredcites →https://doi.org/10.48550/arxiv.1807.09299openalex-extracted
Tractable Graph Matching via Soft Seeding
inferredcites →https://doi.org/10.48550/arxiv.1911.11120openalex-extracted
KerGM: Kernelized Graph Matching
inferredcites →https://doi.org/10.48550/arxiv.2004.03816openalex-extracted
Graph Matching with Partially-Correct Seeds
inferredcites →https://doi.org/10.48550/arxiv.2102.00082openalex-extracted
Settling the Sharp Reconstruction Thresholds of Random Graph Matching
inferredcites →https://doi.org/10.48550/arxiv.2111.05366openalex-extracted
Graph Matching via Optimal Transport
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.