The maximum number of squares in a tree

DOI10.1007/978-3-642-31265-6_3zbMATH Open1358.68226OpenAlexW1511909700MaRDI QIDQ2904476FDOQ2904476

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

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

Recommendations

• Efficient counting of square substrings in a tree
• Efficient counting of square substrings in a tree
• String powers in trees
• String Powers in Trees
• How many squares can a string contain?

Mathematics Subject Classification ID

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

Cited In (14)

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

This page was built for publication: The maximum number of squares in a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904476)