A polynomial transform for matching pairs of weighted graphs
type: Item
instance of: scholarly article
title: A polynomial transform for matching pairs of weighted graphs
zbMATH Open document ID: 0837.05090
DOI: 10.1016/0307-904X(91)90011-D
published in: Applied Mathematical Modelling
publication date: 1996-02-01T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 820340
zbMATH Keywords: polynomial transformation
zbMATH Keywords: optimum matching
zbMATH Keywords: weighted graph matching problem
zbMATH Keywords: NP-complete
zbMATH Keywords: symmetric polynomials
zbMATH Keywords: matching pairs
zbMATH Keywords: weighted graphs
zbMATH Keywords: algorithm
author: H. A. Al-Mohamad
MaRDI profile type: Publication
cites work: An eigendecomposition approach to weighted graph matching problems
cites work: Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis
full work available at URL: 0307-904x(91)90011-d
OpenAlex ID: W2028964244
Recommended article: The matching polynomials of hypergraphs and weighted hypergraphs
Recommended article: Matching polynomials of two classes of graphs
Recommended article: Q3211342
Recommended article: Q3978339
Recommended article: Laplacian matching polynomial of graphs
Recommended article: An eigendecomposition approach to weighted graph matching problems
Recommended article: Q5013015
description: scientific article; zbMATH DE number 820340