Publisher
Springer Nature Singapore
Reference25 articles.
1. Águeda, R., et al.: Safe sets in graphs: graph classes and structural parameters. J. Comb. Optim. 36(4), 1221–1242 (2018). https://doi.org/10.1007/s10878-017-0205-2
2. Bagga, K.S., Beineke, L.W., Goddard, W., Lipman, M.J., Pippert, R.E.: A survey of integrity. Discret. Appl. Math. 37(38), 13–28 (1992). https://doi.org/10.1016/0166-218X(92)90122-Q
3. Barefoot, C.A., Entringer, R.C., Swart, H.C.: Vulnerability in graphs – a comparative survey. J. Combin. Math. Combin. Comput. 1, 13–22 (1987)
4. Belmonte, R., Hanaka, T., Katsikarelis, I., Lampis, M., Ono, H., Otachi, Y.: Parameterized complexity of safe set. J. Graph Algorithms Appl. 24(3), 215–245 (2020). https://doi.org/10.7155/jgaa.00528
5. Bentert, M., Heeger, K., Koana, T.: Fully polynomial-time algorithms parameterized by vertex integrity using fast matrix multiplication. In: ESA 2023. LIPIcs, vol. 274, pp. 16:1–16:16 (2023). https://doi.org/10.4230/LIPIcs.ESA.2023.16
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献