Improving bipartite graph edit distance approximation using various search strategies

DOI10.1016/J.PATCOG.2014.11.002zbMATH Open1374.68473OpenAlexW2027340372MaRDI QIDQ1678686FDOQ1678686

Authors: Kaspar Riesen, Horst Bunke 

Publication date: 20 November 2017

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2014.11.002

Recommendations

• Speeding up graph edit distance computation through fast bipartite matching
• Bipartite Graph Matching for Computing the Edit Distance of Graphs

zbMATH Keywords

approximate graph edit distancebipartite graph matching

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distance in graphs (05C12)

Cites Work

• Title not available (Why is that?)
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Assignment Problems
• A distance measure between attributed relational graphs for pattern recognition
• The Dissimilarity Representation for Pattern Recognition
• Measures of association for cross classifications
• Well-Separated Clusters and Optimal Fuzzy Partitions
• A survey of graph edit distance
• Cost operator algorithms for the transportation problem
• Bridging the Gap between Graph Edit Distance and Kernel Machines
• Inexact graph matching for structural pattern recognition
• QUADRATIC ASSIGNMENT AS A GENERAL DATA ANALYSIS STRATEGY
• Structural pattern recognition using genetic algorithms
• Title not available (Why is that?)
• The Scaling Network Simplex Algorithm
• Structural, Syntactic, and Statistical Pattern Recognition
• Graph-Based Representations in Pattern Recognition
• On the simplex algorithm for networks and generalized networks
• Title not available (Why is that?)
• Improving bipartite graph edit distance approximation using various search strategies
• Title not available (Why is that?)
• A one hour trip in the world of graphs, looking at the papers of the last ten years
• Active-learning query strategies applied to select a graph node given a graph labelling

Cited In (7)

• A local branching heuristic for solving a graph edit distance problem
• On the influence of node centralities on graph edit distance for graph classification
• Exact computation of graph edit distance for uniform and non-uniform metric edit costs
• Improving bipartite graph edit distance approximation using various search strategies
• Improved Graph Edit Distance Approximation with Simulated Annealing
• Bipartite Graph Matching for Computing the Edit Distance of Graphs
• EmbAssi: embedding assignment costs for similarity search in large graph databases

Uses Software

• CLUSTISZ

This page was built for publication: Improving bipartite graph edit distance approximation using various search strategies

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