A polynomial transform for matching pairs of weighted graphs
From MaRDI portal
Publication:1903232
DOI10.1016/0307-904X(91)90011-DzbMath0837.05090MaRDI QIDQ1903232
Publication date: 1 February 1996
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
algorithm; weighted graphs; symmetric polynomials; NP-complete; optimum matching; polynomial transformation; matching pairs; weighted graph matching problem
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Cites Work