Funder
Ministerul Educaţiei şi Cercetării Ştiinţifice
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference60 articles.
1. Abboud, A., Williams, V.V., Wang, J.R.: Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 377–391. SIAM (2016)
2. Bondy, J.A., Murty, U.S.R.: Graph theory. Graduate Texts in Mathematics, vol. 244. Springer-Verlag, London (2008)
3. Borie, R., Johnson, J., Raghavan, V., Spinrad, J.: Robust polynomial time algorithms on clique-width $$k$$ graphs. (2002)
4. Brandstädt, A., Dabrowski, K.K., Huang, S., Paulusma, D.: Bounding the clique-width of $$H$$-free split graphs. Discrete Appl. Math. 211, 30–39 (2016)
5. Brandstädt, A., Dabrowski, K.K., Huang, S., Paulusma, D.: Bounding the Clique-Width of $$H$$-Free Chordal Graphs. J. of Graph Theory 86(1), 42–77 (2017)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献