The Maximum Number of Squares in a Tree

DOI10.1007/978-3-642-31265-6_3zbMath1358.68226OpenAlexW1511909700MaRDI QIDQ2904476

Wojciech Tyczyński, Costas S. Iliopoulos, Tomasz Kociumaka, Maxime Crochemore, Jakub Radoszewski, Tomasz Walen, Marcin Kubica, Wojciech Rytter

Publication date: 14 August 2012

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31265-6_3

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics on words (68R15)

Related Items

Efficiently computing runs on a trie, Palindromic Complexity of Trees, Maximum number of distinct and nonequivalent nonstandard squares in a word, String covers of a tree, Lower bounds for the number of repetitions in 2D strings, String Powers in Trees, String powers in trees, Tight bound for the number of distinct palindromes in a tree, Experimental evaluation of algorithms for computing quasiperiods, Distinct Squares in Circular Words, Efficient counting of square substrings in a tree, Computing runs on a trie