On the public citation graph

A Novel Method for Graph Matching

0 signed · 15 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.1007/978-1-4419-6045-0_7openalex-snapshot

Exact and Inexact Graph Matching: Methodology and Applications

inferredcites →https://doi.org/10.1007/978-3-642-15555-0_36openalex-snapshot

Reweighted Random Walks for Graph Matching

inferredcites →https://doi.org/10.1007/s11263-019-01185-1openalex-snapshot

Efficient Feature Matching via Nonnegative Orthogonal Relaxation

inferredcites →https://doi.org/10.1016/j.patcog.2013.08.024openalex-snapshot

A sparse nonnegative matrix factorization technique for graph matching problems

inferredcites →https://doi.org/10.1016/j.patrec.2018.07.005openalex-snapshot

Subgraph learning for graph matching

inferredcites →https://doi.org/10.1109/34.491619openalex-snapshot

A graduated assignment algorithm for graph matching

inferredcites →https://doi.org/10.1109/cvpr.2014.268openalex-snapshot

Finding Matches in a Haystack: A Max-Pooling Strategy for Graph Matching in the Presence of Outliers

inferredcites →https://doi.org/10.1109/cvpr.2017.522openalex-snapshot

Alternating Direction Graph Matching

inferredcites →https://doi.org/10.1109/iccv.2005.20openalex-snapshot

A spectral technique for correspondence problems using pairwise constraints

inferredcites →https://doi.org/10.1109/tpami.2017.2767591openalex-snapshot

Graph Matching with Adaptive and Branching Path Following

inferredcites →https://doi.org/10.1184/r1/6561212openalex-snapshot

The Dynamic Hungarian Algorithm for the Assignment Problem with Changing Costs

inferredcites →https://doi.org/10.1609/aaai.v31i1.11210openalex-snapshot

Nonnegative Orthogonal Graph Matching

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.5281/zenodo.5534294openalex-extracted

inferred← citeshttps://doi.org/10.1609/icwsm.v16i1.19331openalex-snapshot

A Unified Graph-Based Approach to Disinformation Detection Using Contextual and Semantic Relations

inferred← citeshttps://doi.org/10.1609/icwsm.v18i1.31396openalex-snapshot

HyperGraphDis: Leveraging Hypergraphs for Contextual and Social-Based Disinformation Detection

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.