A polynomial transform for matching pairs of weighted graphs

DOI10.1016/0307-904X(91)90011-DMaRDI QIDQ1903232zbMATH OpenOpenAlexFDO

Authors 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

algorithmNP-completeoptimum matchingsymmetric polynomialsweighted graphspolynomial 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)

Recommendations

• The matching polynomials of hypergraphs and weighted hypergraphs
• Matching polynomials of two classes of graphs
• scientific article; zbMATH DE number 4191717
• scientific article; zbMATH DE number 12050
• Laplacian matching polynomial of graphs
• An eigendecomposition approach to weighted graph matching problems
• Two graph transformations and their applications to matching theory of graphs

Cites work

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

Cited in

(3)

• Kronecker product graph matching.
• An algorithm for weighted sub-graph matching based on gradient flows
• NON-RIGID SPECTRAL CORRESPONDENCE OF TRIANGLE MESHES

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1903232)