Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism

DOI10.1007/978-3-642-19222-7_8zbMATH Open1326.68210OpenAlexW2142266575MaRDI QIDQ3000495FDOQ3000495

Yusaku Kaneta, Hiroki Arimura

Publication date: 19 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_8

Recommendations

• Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
• Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
• Ordered and Unordered Tree Inclusion
• Tree template matching in unranked ordered trees
• Constrained tree inclusion

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Database theory (68P15) Parallel algorithms in computer science (68W10)

Cites Work

• Title not available (Why is that?)
• Ordered and Unordered Tree Inclusion
• Automata, Languages and Programming
• New Algorithms for Regular Expression Matching
• A Four Russians algorithm for regular expression pattern matching
• Constrained tree inclusion
• Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees

Cited In (2)

• Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
• Fast parallel reordering and isomorphism testing of \(k\)-trees

This page was built for publication: Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000495)