A polynomial transform for matching pairs of weighted graphs

DOI10.1016/0307-904X(91)90011-DzbMath0837.05090OpenAlexW2028964244MaRDI QIDQ1903232

H. A. Al-Mohamad

Publication date: 1 February 1996

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0307-904x(91)90011-d

zbMATH Keywords

algorithmweighted graphssymmetric polynomialsNP-completeoptimum matchingpolynomial transformationmatching pairsweighted graph matching problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

NON-RIGID SPECTRAL CORRESPONDENCE OF TRIANGLE MESHES ⋮ Kronecker product graph matching.

Cites Work

• An eigendecomposition approach to weighted graph matching problems
• Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis

This page was built for publication: A polynomial transform for matching pairs of weighted graphs