Author:
Papadopoulos Charis,Tzimas Spyridon
Publisher
Springer International Publishing
Reference39 articles.
1. Benjamin, B., Papadopoulos, C., Telle, J.A.: Node multiway cut and subset feedback vertex set on graphs of bounded mim-width. In: Adler, I., Müller, H. (eds.) Graph-Theoretic Concepts in Computer Science, WG 2020. LNCS, vol. 12301, pp. 388–400. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-60440-0_31
2. Bertossi, A.A., Bonuccelli, M.A.: Hamiltonian circuits in interval graph generalizations. Inf. Process. Lett. 23(4), 195–200 (1986)
3. Bodlaender, H.L., Jansen, K.: On the complexity of the maximum cut problem. Nord. J. Comput. 7(1), 14–31 (2000)
4. Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Cham (2008)
5. Booth, K.S., Johnson, J.H.: Dominating sets in chordal graphs. SIAM J. Comput. 11, 191–199 (1982)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献