Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees (Q3183485): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Tree pattern matching with a more general notion of occurrence of the pattern. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying candidate matches in sparse and wildcard matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Pattern Matching to Subset Matching in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster tree pattern matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern Matching in Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered and Unordered Tree Inclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Subtree Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2004: Theory and Practice of Computer Science / rank
 
Normal rank

Latest revision as of 02:26, 2 July 2024

scientific article
Language Label Description Also known as
English
Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
scientific article

    Statements