Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism (Q450558): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59278876, #quickstatements; #temporary_batch_1712272666262
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in linear time? / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithms for Regular Expression Matching / 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: The tree inclusion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: More Efficient Algorithm for Ordered Tree Inclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conjunctive queries over trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern Matching in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered and Unordered Tree Inclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3393339 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Four Russians algorithm for regular expression pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4534878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained tree inclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functions realizable with word-parallel logical and two's-complement addition instructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees / rank
 
Normal rank

Latest revision as of 17:06, 5 July 2024

scientific article
Language Label Description Also known as
English
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
scientific article

    Statements

    Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism (English)
    0 references
    0 references
    0 references
    0 references
    13 September 2012
    0 references
    tree matching
    0 references
    bit-parallel algorithms
    0 references
    unordered trees
    0 references
    XML queries
    0 references
    string matching
    0 references

    Identifiers