Pages that link to "Item:Q2118211"
From MaRDI portal
The following pages link to On the complexity of recognizing Wheeler graphs (Q2118211):
Displaying 7 items.
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
- Wheeler graphs: a framework for BWT-based data structures (Q1676308) (← links)
- Wheeler languages (Q2051845) (← links)
- Space efficient merging of de Bruijn graphs and Wheeler graphs (Q2118200) (← links)
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs (Q5075794) (← links)
- Representing graphs by disks and balls (a survey of recognition-complexity results) (Q5931448) (← links)
- Quantum time complexity and algorithms for pattern matching on labeled graphs (Q6111593) (← links)