Yusaku Kaneta, Hiroki Arimura. Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism. In Costas S. Iliopoulos, William F. Smyth, editors, Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers. Volume 6460 of Lecture Notes in Computer Science, pages 68-81, Springer, 2010. [doi]
@inproceedings{KanetaA10,
title = {Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism},
author = {Yusaku Kaneta and Hiroki Arimura},
year = {2010},
doi = {10.1007/978-3-642-19222-7_8},
url = {http://dx.doi.org/10.1007/978-3-642-19222-7_8},
researchr = {https://researchr.org/publication/KanetaA10},
cites = {0},
citedby = {0},
pages = {68-81},
booktitle = {Combinatorial Algorithms - 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers},
editor = {Costas S. Iliopoulos and William F. Smyth},
volume = {6460},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-19221-0},
}