Improving bipartite graph edit distance approximation using various search strategies
type: Item
instance of: scholarly article
title: Improving bipartite graph edit distance approximation using various search strategies
zbMATH Open document ID: 1374.68473
author: Kaspar Riesen
author: Horst Bunke
published in: Pattern Recognition
publication date: 2017-11-20T00:00:00Z
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6809009
zbMATH Keywords: bipartite graph matching
zbMATH Keywords: approximate graph edit distance
describes a project that uses: CLUSTISZ
MaRDI profile type: Publication
full work available at URL: j.patcog.2014.11.002
OpenAlex ID: W2027340372
cites work: A One Hour Trip in the World of Graphs, Looking at the Papers of the Last Ten Years
cites work: A distance measure between attributed relational graphs for pattern recognition
cites work: Inexact graph matching for structural pattern recognition
cites work: A survey of graph edit distance
cites work: Graph-Based Representations in Pattern Recognition
cites work: Structural, Syntactic, and Statistical Pattern Recognition
cites work: Q4450785
cites work: Assignment Problems
cites work: Q4808944
cites work: Q5519710
cites work: A shortest augmenting path algorithm for dense and sparse linear assignment problems
cites work: On the simplex algorithm for networks and generalized networks
cites work: The Scaling Network Simplex Algorithm
cites work: Cost operator algorithms for the transportation problem
cites work: Q3974955
cites work: Structural pattern recognition using genetic algorithms
cites work: Q3994557
cites work: Well-Separated Clusters and Optimal Fuzzy Partitions
cites work: QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
cites work: Q5180702
cites work: Measures of association for cross classifications
cites work: Active-Learning Query Strategies Applied to Select a Graph Node Given a Graph Labelling
cites work: The Dissimilarity Representation for Pattern Recognition
cites work: Bridging the Gap between Graph Edit Distance and Kernel Machines
DOI: 10.1016/J.PATCOG.2014.11.002
Recommended article: Speeding Up Graph Edit Distance Computation through Fast Bipartite Matching
Recommended article: Bipartite Graph Matching for Computing the Edit Distance of Graphs
description: scientific article; zbMATH DE number 6809009