Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference49 articles.
1. Agaoglu, D., Hlinený, P.: Isomorphism problem for s\_d-graphs. In: Esparza, J., Daniel, K (eds) 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020, August 24–28, 2020, Prague, Czech Republic, volume 170 of LIPIcs, pp. 4:1–4:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020)
2. Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A c$${}^{{\rm k}}$$ n 5-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317–378 (2016)
3. Biró, M., Hujter, M., Tuza, Z.: Precoloring extension. I. Interval graphs. Discrete. Math. 100(1–3), 267–279 (1992)
4. Booth, K.S., Johnson, J.H.: Dominating sets in chordal graphs. SIAM J. Comput. 11(1), 191–199 (1982)
5. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13(3), 335–379 (1976)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献