Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improved approximation of the largest common subtree of two unordered trees of bounded height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for computing the tree edit distance between unordered trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees / 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: On Tree-Constrained Matchings and Generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal decomposition algorithm for tree edit distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered and Unordered Tree Inclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Visual Explanation of Jensen's Inequality / 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: The Tree-to-Tree Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some MAX SNP-hard results concerning unordered labeled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the editing distance between unordered labeled trees / rank
 
Normal rank

Latest revision as of 13:37, 7 July 2024

scientific article
Language Label Description Also known as
English
Efficient exponential-time algorithms for edit distance between unordered trees
scientific article

    Statements

    Efficient exponential-time algorithms for edit distance between unordered trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 April 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    edit distance
    0 references
    unordered tree
    0 references
    algorithm
    0 references
    bipartite matching
    0 references
    0 references