New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings
From MaRDI portal
Publication:2965481
DOI10.4230/LIPICS.STACS.2014.162zbMATH Open1359.68238OpenAlexW2245827370MaRDI QIDQ2965481FDOQ2965481
Benjamin De Winkle, M. Bodnar, F. Blanchet-Sadri
Publication date: 3 March 2017
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2014/4455/pdf/13.pdf
Recommendations
- New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings
- Indeterminate strings, prefix arrays \& undirected graphs
- Inferring an indeterminate string from a prefix graph
- Representing prefix and border tables: results on enumeration
- On the number of prefix and border tables
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorics on words (68R15)
Cited In (6)
- Combinatorics on partial word borders
- Universal Reconstruction of a String
- Border correlations, lattices, and the subgraph component polynomial
- New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings
- A prefix array for parameterized strings
- Inferring an indeterminate string from a prefix graph
This page was built for publication: New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2965481)
