Border Correlations, Lattices, and the Subgraph Component Polynomial

DOI10.1007/978-3-319-19315-1_6zbMath1396.05004OpenAlexW1044152031MaRDI QIDQ2946042

Michelle Cordier, Francine Blanchet-Sadri, Rachel Kirsch

Publication date: 15 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-19315-1_6

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items (1)

Border correlations, lattices, and the subgraph component polynomial

Cites Work

• Indeterminate strings, prefix arrays \& undirected graphs
• Counting bordered partial words by critical positions
• The enumeration of vertex induced subgraphs with respect to the number of components
• Border correlation of binary words
• Combinatorics on partial word correlations
• Border correlations of partial words
• From a zoo to a zoology: Towards a general theory of graph polynomials
• Periods in strings
• Combinatorics of periods in strings.
• A Graph Polynomial Approach to Primitivity
• Algorithmic Combinatorics on Partial Words
• Algorithms on Strings

This page was built for publication: Border Correlations, Lattices, and the Subgraph Component Polynomial