Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism
From MaRDI portal
Publication:3000495
DOI10.1007/978-3-642-19222-7_8zbMath1326.68210OpenAlexW2142266575MaRDI QIDQ3000495
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
Analysis of algorithms and problem complexity (68Q25) Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Cites Work
This page was built for publication: Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism