A polynomial transform for matching pairs of weighted graphs (Q1903232): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An eigendecomposition approach to weighted graph matching problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis / rank | |||
Normal rank | |||
Latest revision as of 08:39, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial transform for matching pairs of weighted graphs |
scientific article |
Statements
A polynomial transform for matching pairs of weighted graphs (English)
0 references
1 February 1996
0 references
polynomial transformation
0 references
optimum matching
0 references
weighted graph matching problem
0 references
NP-complete
0 references
symmetric polynomials
0 references
matching pairs
0 references
weighted graphs
0 references
algorithm
0 references
