Pages that link to "Item:Q496001"
From MaRDI portal
The following pages link to Indeterminate strings, prefix arrays \& undirected graphs (Q496001):
Displaying 11 items.
- Computing covers using prefix tables (Q313747) (← links)
- A prefix array for parameterized strings (Q511148) (← links)
- Border correlations, lattices, and the subgraph component polynomial (Q1678101) (← links)
- Reconstructing a string from its Lyndon arrays (Q1698704) (← links)
- Constructing an indeterminate string from its associated graph (Q1698711) (← links)
- An improved upper bound and algorithm for clique covers (Q1748206) (← links)
- A new approach to regular \& indeterminate strings (Q2220865) (← links)
- Universal reconstruction of a string (Q2297860) (← links)
- Inferring an indeterminate string from a prefix graph (Q2343296) (← links)
- New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings (Q2363963) (← links)
- Border Correlations, Lattices, and the Subgraph Component Polynomial (Q2946042) (← links)
