Tight bound for the number of distinct palindromes in a tree

HIGHLIGHTS

  • who: Paweu0142 Gawrychowski and collaborators from the Institute of Computer Science University of Wrocu0142aw Poland have published the paper: Tight Bound for the Number of Distinct Palindromes in a Tree, in the Journal: (JOURNAL)
  • what: Among the basic types of such structures are palindromes: symmetric words that are the same * A preliminary version of this paper, without algorithmic results, was presented at SPIRE 2015 . the electronic journal of combinatorics 30(2) , #P2.10 when read in both directions. In Section 3.3, the authors show how every tree can be decomposed into spine trees, and . . .

     

    Logo ScioWire Beta black

    If you want to have access to all the content you need to log in!

    Thanks :)

    If you don't have an account, you can create one here.

     

Scroll to Top

Add A Knowledge Base Question !

+ = Verify Human or Spambot ?