On the public citation graph

An Extended Path Following Algorithm for Graph-Matching Problem

https://doi.org/10.1109/tpami.2012.45

0 signed · 74 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-snapshot

The Hungarian method for the assignment problem

inferredcites →https://doi.org/10.1007/3-540-52255-7_36openalex-snapshot

Improved simulated annealing, Boltzmann machine, and attributed graph matching

inferredcites →https://doi.org/10.1017/cbo9780511804441openalex-snapshot

Convex Optimization

inferredcites →https://doi.org/10.1023/a:1008293323270openalex-snapshot

QAPLIB – A Quadratic Assignment Problem Library

inferredcites →https://doi.org/10.1073/pnas.0806627105openalex-snapshot

Global alignment of multiple protein interaction networks with application to functional orthology detection

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

Bounds on the extreme eigenvalues of positive-definite Toeplitz matrices

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

A linear programming approach for the weighted graph matching problem

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

A graduated assignment algorithm for graph matching

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

An eigendecomposition approach to weighted graph matching problems

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

Bayesian graph edit distance

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

An Image Understanding System Using Attributed Symbolic Representation and Inexact Graph-Matching

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

A Path Following Algorithm for the Graph Matching Problem

inferredcites →https://doi.org/10.1137/050627812openalex-snapshot

Extremal Eigenvalues of Real Symmetric Matrices with Entries in an Interval

inferredcites →https://doi.org/10.1142/s0218001404003228openalex-snapshot

THIRTY YEARS OF GRAPH MATCHING IN PATTERN RECOGNITION

inferredcites →https://doi.org/10.1145/800119.803896openalex-snapshot

Linear time algorithm for isomorphism of planar graphs (Preliminary Report)

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.4349148openalex-extracted

3d Formation Control of Multiple Uuvs Based on Virtual Target Points

inferred← citeshttps://doi.org/10.1007/978-3-031-20050-2_22openalex-snapshot

Self-supervised Learning of Visual Graph Matching

inferred← citeshttps://doi.org/10.1007/978-3-319-12640-1_49openalex-snapshot

MAP Inference with MRF by Graduated Non-Convexity and Concavity Procedure

inferred← citeshttps://doi.org/10.1007/978-3-319-14612-6_4openalex-snapshot

On the Link between Gaussian Homotopy Continuation and Convex Envelopes

inferred← citeshttps://doi.org/10.1007/978-3-319-39937-9_28openalex-snapshot

A General Framework for Graph Matching and Its Application in Ontology Matching

inferred← citeshttps://doi.org/10.1007/978-3-642-31919-8_2openalex-snapshot

A Weight Regularized Relaxation Based Graph Matching Algorithm

inferred← citeshttps://doi.org/10.1007/978-3-662-48558-3_5openalex-snapshot

A Graph Matching and Energy Minimization Based Algorithm for Lunar Surface Image Mosaic

inferred← citeshttps://doi.org/10.1007/978-981-97-6266-8_1openalex-snapshot

Introduction

inferred← citeshttps://doi.org/10.1007/s11222-022-10079-1openalex-snapshot

Graph matching beyond perfectly-overlapping Erdős–Rényi random graphs

inferred← citeshttps://doi.org/10.1007/s11263-014-0707-7openalex-snapshot

Graph Matching by Simplified Convex-Concave Relaxation Procedure

inferred← citeshttps://doi.org/10.1007/s11263-019-01185-1openalex-snapshot

Efficient Feature Matching via Nonnegative Orthogonal Relaxation

inferred← citeshttps://doi.org/10.1007/s11263-020-01359-2openalex-snapshot

Image Matching from Handcrafted to Deep Features: A Survey

inferred← citeshttps://doi.org/10.1016/j.compbiomed.2022.106406openalex-snapshot

RV-ESA: A novel computer-aided elastic shape analysis system for retinal vessels in diabetic retinopathy

inferred← citeshttps://doi.org/10.1016/j.cviu.2019.03.003openalex-snapshot

Sub-hypergraph matching based on adjacency tensor

inferred← citeshttps://doi.org/10.1016/j.dsp.2020.102833openalex-snapshot

Towards affine-invariant graph matching: A directed graph based method

inferred← citeshttps://doi.org/10.1016/j.ijnaoe.2019.11.003openalex-snapshot

Spatial target path following and coordinated control of multiple UUVs

inferred← citeshttps://doi.org/10.1016/j.imavis.2014.11.001openalex-snapshot

Feature correspondence based on directed structural model matching

inferred← citeshttps://doi.org/10.1016/j.neucom.2013.06.031openalex-snapshot

Partial correspondence based on subgraph matching

inferred← citeshttps://doi.org/10.1016/j.neucom.2015.12.082openalex-snapshot

Introducing locally affine-invariance constraints into lunar surface image correspondence

inferred← citeshttps://doi.org/10.1016/j.neucom.2016.11.048openalex-snapshot

LibCoopt: A library for combinatorial optimization on partial permutation matrices

inferred← citeshttps://doi.org/10.1016/j.neucom.2016.12.096openalex-snapshot

Probabilistic hypergraph matching based on affinity tensor updating

inferred← citeshttps://doi.org/10.1016/j.patcog.2016.12.006openalex-snapshot

Point correspondence by a new third order graph matching algorithm

inferred← citeshttps://doi.org/10.1016/j.patcog.2017.12.003openalex-snapshot

Product graph-based higher order contextual similarities for inexact subgraph matching

inferred← citeshttps://doi.org/10.1016/j.patcog.2018.09.014openalex-snapshot

Seeded graph matching

inferred← citeshttps://doi.org/10.1016/j.patrec.2014.12.011openalex-snapshot

Outlier robust point correspondence based on GNCCP

inferred← citeshttps://doi.org/10.1016/j.patrec.2018.09.024openalex-snapshot

Exploiting multi-layer graph factorization for multi-attributed graph matching

inferred← citeshttps://doi.org/10.1109/access.2019.2904541openalex-snapshot

Left Ventricle Motion Estimation in Cine MRI With Multilayer Iterative Deformable Graph Matching

inferred← citeshttps://doi.org/10.1109/cisp-bmei51763.2020.9263681openalex-snapshot

A Survey On Graph Matching In Computer Vision

inferred← citeshttps://doi.org/10.1109/cvpr42600.2020.00715openalex-snapshot

Determinant Regularization for Gradient-Efficient Graph Matching

inferred← citeshttps://doi.org/10.1109/cvprw50498.2020.00424openalex-snapshot

Representations, Metrics and Statistics for Shape Analysis of Elastic Graphs

inferred← citeshttps://doi.org/10.1109/iccv.2015.31openalex-snapshot

A Matrix Decomposition Perspective to Multiple Graph Matching

inferred← citeshttps://doi.org/10.1109/icicse52190.2021.9404132openalex-snapshot

Probabilistic Graph Matching with Multiplicative Updating Algorithm for Correspondence between Remote Sensing Images

inferred← citeshttps://doi.org/10.1109/icivc.2018.8492896openalex-snapshot

Generalizing Integer Projected Graph Matching Algorithm for Outlier Problem

inferred← citeshttps://doi.org/10.1109/tcds.2022.3188333openalex-snapshot

A Novel Biologically Inspired Structural Model for Feature Correspondence

inferred← citeshttps://doi.org/10.1109/tcyb.2017.2697968openalex-snapshot

Adaptive Graph Matching

inferred← citeshttps://doi.org/10.1109/tcyb.2019.2936176openalex-snapshot

Elastic Net Constraint-Based Tensor Model for High-Order Graph Matching

inferred← citeshttps://doi.org/10.1109/tnnls.2017.2712794openalex-snapshot

An Algorithm for Finding the Most Similar Given Sized Subgraphs in Two Weighted Graphs

inferred← citeshttps://doi.org/10.1109/tpami.2013.223openalex-snapshot

GNCCP—Graduated NonConvexityand Concavity Procedure

inferred← citeshttps://doi.org/10.1109/tpami.2015.2501802openalex-snapshot

Factorized Graph Matching

inferred← citeshttps://doi.org/10.1109/tpami.2016.2574706openalex-snapshot

An Efficient Multilinear Optimization Framework for Hypergraph Matching

inferred← citeshttps://doi.org/10.1109/tpami.2019.2903483openalex-snapshot

A Continuation Method for Graph Matching Based Feature Correspondence

inferred← citeshttps://doi.org/10.1109/tpami.2021.3078053openalex-snapshot

Neural Graph Matching Network: Learning Lawler’s Quadratic Assignment Problem with Extension to Hypergraph and Multiple-graph Matching

inferred← citeshttps://doi.org/10.1109/tvt.2022.3221447openalex-snapshot

Handover Analysis in Ultra-Dense LEO Satellite Networks With Beamforming Methods

inferred← citeshttps://doi.org/10.1109/wcica.2014.7052744openalex-snapshot

A probabilistic spectral graph matching algorithm for robust correspondence between lunar surface images

inferred← citeshttps://doi.org/10.1109/wcica.2016.7578355openalex-snapshot

A graph matching based key point correspondence method for lunar surface images

inferred← citeshttps://doi.org/10.1137/15m1048021openalex-snapshot

$L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices

inferred← citeshttps://doi.org/10.1145/2911996.2912035openalex-snapshot

A Short Survey of Recent Advances in Graph Matching

inferred← citeshttps://doi.org/10.1145/3265639.3265665openalex-snapshot

Quadratic Assignment Problem via a Convex and Concave Relaxations Procedure

inferred← citeshttps://doi.org/10.1145/3711896.3736839openalex-snapshot

Alpine: Partial Unlabeled Graph Alignment

inferred← citeshttps://doi.org/10.1214/21-aoas1536openalex-snapshot

Statistical shape analysis of brain arterial networks (BAN)

inferred← citeshttps://doi.org/10.1371/journal.pone.0121002openalex-snapshot

Fast Approximate Quadratic Programming for Graph Matching

inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9356openalex-snapshot

A Theoretical Analysis of Optimization by Gaussian Continuation

inferred← citeshttps://doi.org/10.1609/aaai.v31i1.11210openalex-snapshot

Nonnegative Orthogonal Graph Matching

inferred← citeshttps://doi.org/10.1609/aaai.v35i4.16461openalex-snapshot

IA-GM: A Deep Bidirectional Learning Method for Graph Matching

inferred← citeshttps://doi.org/10.3390/s21134394openalex-snapshot

WDA: An Improved Wasserstein Distance-Based Transfer Learning Fault Diagnosis Method

inferred← citeshttps://doi.org/10.48550/arxiv.1112.5507openalex-snapshot

Fast Approximate Quadratic Programming for Large (Brain) Graph Matching

inferred← citeshttps://doi.org/10.48550/arxiv.1308.6388openalex-snapshot

GNCGCP - Graduated NonConvexity and Graduated Concavity Procedure

inferred← citeshttps://doi.org/10.48550/arxiv.1411.0763openalex-snapshot

A Weighted Common Subgraph Matching Algorithm

inferred← citeshttps://doi.org/10.48550/arxiv.2012.08950openalex-snapshot

Revocable Deep Reinforcement Learning with Affinity Regularization for Outlier-Robust Graph Matching

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.