Publisher
Springer Nature Switzerland
Reference21 articles.
1. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)
2. Bang-Jensen, J., Gutin, G.Z.: Digraphs: Theory, Algorithms and Applications. Springer Science & Business Media (2008)
3. Lecture Notes in Computer Science;HL Bodlaender,2007
4. Cáceres, M.: Parameterized algorithms for string matching to dags: funnels and beyond. In: Bulteau, L., Lipták, Z. (eds.) 34th Annual Symposium on Combinatorial Pattern Matching, CPM 2023, 26–28 June 2023, Marne-la-Vallée, France. LIPIcs, vol. 259, pp. 7:1–7:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023). https://doi.org/10.4230/LIPICS.CPM.2023.7
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, Second Edition, chap. 16, pp. 370–404. The MIT Press and McGraw-Hill Book Company (2001)