Efficient Counting of Square Substrings in a Tree

DOI10.1007/978-3-642-35261-4_24zbMath1260.68490OpenAlexW1699845608MaRDI QIDQ4909537

Jakub W. Pachocki, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen

Publication date: 21 March 2013

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_24

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Algorithms on strings (68W32)

Related Items

Efficient counting of square substrings in a tree