A graph matching method based on leading Eigenvector and Sinkhorn-Knopp algorithm - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2021

A graph matching method based on leading Eigenvector and Sinkhorn-Knopp algorithm

(1)
1

Abstract

The goal of the report is to present a graph matching method based on the leading Eigenvector and Sinkhorn-Knopp algorithm. This method is not new and is reported in [6].
Fichier principal
Vignette du fichier
AroundGraphMatchingRelaxedAndRefined.pdf (272 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03390290 , version 1 (21-10-2021)
hal-03390290 , version 2 (09-11-2021)

Identifiers

  • HAL Id : hal-03390290 , version 2

Cite

Romain Raveaux. A graph matching method based on leading Eigenvector and Sinkhorn-Knopp algorithm. [Research Report] Université de Tours - LIFAT. 2021. ⟨hal-03390290v2⟩
32 View
15 Download

Share

Gmail Facebook Twitter LinkedIn More