Papers › Lightning graph matching
Lightning graph matching
Binrui. shen, Qiang. niu, Shengxin. zhu
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Graph matching aims to find correspondences between two graphs. It is a fundamental task in pattern recognition. The classical spectral matching algorithm has time complexity 𝒪(n⁴) and space complexity 𝒪(n⁴), where n is the number of nodes. Such a complexity limits the applicability to large-scale graph matching tasks. This paper proposes an efficient redesign of spectral matching by transforming the graph matching problem into a 1D linear assignment problem, which can be solved efficiently by sorting two n ×1 vectors. The resulting algorithm is named the lightning spectral assignment method (LiSA), which enjoys a complexity of 𝒪(n²). Numerical experiments demonstrate the efficiency and the theoretical analysis of the strategy.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections