scientific article; zbMATH DE number 2090203

zbMATH Open1073.68790MaRDI QIDQ4808933FDOQ4808933

Authors: Antonio Robles-Kelly, Edwin R. Hancock 

Publication date: 12 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2396/23960104.htm

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2043363
• Bipartite Graph Matching for Computing the Edit Distance of Graphs
• Approximation of graph edit distance in quadratic time
• Graph-Based Representations in Pattern Recognition
• Speeding up graph edit distance computation through fast bipartite matching

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45)

Cited In (9)

• A Probabilistic Analysis of a String Editing Problem and its Variations
• Calculating distances for dissimilar strings: the shortest path formulation revisited
• Title not available (Why is that?)
• Title not available (Why is that?)
• Graph simplification and matching using commute times
• Period recovery of strings over the Hamming and edit distances
• Classes of cost functions for string edit distance
• The graph matching problem
• Matching patterns with variables under edit distance

This page was built for publication:

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