Publisher
Springer Nature Singapore
Reference18 articles.
1. Abboud, A., Backurs, A., Hansen, T.D., Vassilevska Williams, V., Zamir, O.: Subtree isomorphism revisited. ACM Trans. Algorithms 14(3) (2018). https://doi.org/10.1145/3093239
2. Akutsu, T., Jansson, J., Li, R., Takasu, A., Tamura, T.: New and improved algorithms for unordered tree inclusion. Theoret. Comput. Sci. 883, 83–98 (2021). https://doi.org/10.1016/j.tcs.2021.06.013
3. Bodlaender, H.L., et al.: Subgraph isomorphism on graph classes that exclude a substructure. Algorithmica 82(12), 3566–3587 (2020). https://doi.org/10.1007/s00453-020-00737-z
4. Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1990)
5. Gómez, R., Gutiérrez, J.: Path eccentricity of graphs. Discret. Appl. Math. 337, 1–13 (2023). https://doi.org/10.1016/j.dam.2023.04.012