Algorithms for approximate graph matching (Q1357079): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4065051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3670607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Algorithm For Approximate String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Noisy Substring Matching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel and serial approximate string matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern matching in a digitized image / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tree-Matching Algorithm Based on Node Splitting and Merging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate matching of regular expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4509227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory and computation of evolutionary distances: Pattern recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximate algorithms for unordered tree matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for the unit cost editing distance between trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tree-to-Tree Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding approximate patterns in strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Subgraph Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Tree Matching in the Presence of Variable Length Don′t Cares / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the editing distance between unordered labeled trees / rank
 
Normal rank

Revision as of 16:54, 27 May 2024

scientific article
Language Label Description Also known as
English
Algorithms for approximate graph matching
scientific article

    Statements

    Algorithms for approximate graph matching (English)
    0 references
    0 references
    0 references
    0 references
    16 June 1997
    0 references
    labeled graphs
    0 references
    approximate graph matching problem
    0 references

    Identifiers