An Edit Distance Between Graph Correspondences (Q5082160): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A long trip in the charming world of graphs for pattern recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on tree edit distance and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distance measure between attributed relational graphs for pattern recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of graph edit distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Influence of Node Centralities on Graph Edit Distance for Graph Classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted mean of a pair of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized median graph computation by means of graph embedding in vector spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ensemble clustering by means of clustering embedding in vector spaces / rank
 
Normal rank

Latest revision as of 08:53, 29 July 2024

scientific article; zbMATH DE number 7542185
Language Label Description Also known as
English
An Edit Distance Between Graph Correspondences
scientific article; zbMATH DE number 7542185

    Statements

    Identifiers