Graph matching with hierarchical discrete relaxation
type: Item
instance of: scholarly article
title: Graph matching with hierarchical discrete relaxation
zbMATH Open document ID: 0942.68139
DOI: 10.1016/S0167-8655(99)00071-9
author: Richard C. Wilson
author: Edwin R. Hancock
published in: Pattern Recognition Letters
publication date: 2000-01-17T00:00:00Z
Mathematics Subject Classification ID: 68U20
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1389644
zbMATH Keywords: hierarchical relational models
Wikidata QID: Q60431581
MaRDI profile type: Publication
DBLP publication ID: journals/prl/WilsonH99
Recommended article: Graph matching by simplified convex-concave relaxation procedure
Recommended article: Lagrangian relaxation graph matching
Recommended article: Inexact graph matching using a hierarchy of matching processes
Recommended article: Graph Matching Based on Stochastic Perturbation
Recommended article: Combinatorial and matrix methods for graph matching
description: scientific article; zbMATH DE number 1389644