Finding approximate patterns in undirected acyclic graphs (Q5959618): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Exact and approximate algorithms for unordered tree matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding approximate patterns in strings / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Scaling Algorithms for Network Problems / rank
 
Normal rank

Revision as of 23:50, 3 June 2024

scientific article; zbMATH DE number 1720229
Language Label Description Also known as
English
Finding approximate patterns in undirected acyclic graphs
scientific article; zbMATH DE number 1720229

    Statements

    Identifiers