✦ LIBER ✦

Efficient counting of square substrings in a tree

✍ Scribed by Kociumaka, Tomasz; Pachocki, Jakub; Radoszewski, Jakub; Rytter, Wojciech; Waleń, Tomasz

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Suffix tree searcher: exploration of com

✍ David Minkley,Michael J Whitney,Song-Han Lin,Marina G Barsky… 📂 Article 📅 2014 🏛 BioMed Central 🌐 English ⚖ 777 KB

Path-Factors in the Square of a Tree

✍ Xiaojuan Li; Zhao Zhang 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 144 KB

Listing and Counting Subtrees of a Tree

✍ Ruskey, Frank 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 767 KB

Counting embeddings of a chain into a tr

✍ Małgorzata Kuchta; Michał Morayne; Jarosław Niemiec 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Relative Efficiency of Count of Sign Cha

✍ R. C. Geary 📂 Article 📅 1970 🏛 Oxford University Press 🌐 English ⚖ 485 KB

Counting trees in a graph is #P-complete

✍ Mark Jerrum 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 469 KB