Publisher
Springer International Publishing
Reference24 articles.
1. Belmonte, R., Golovach, P.A., Heggernes, P., Hof, P.V., Kamiński, M., Paulusma, D.: Detecting fixed patterns in chordal graphs in polynomial time. Algorithmica 69(3), 501–521 (2014)
2. Bodlaender, H.L., Thomassé, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. Theoret. Comput. Sci. 412(35), 4570–4578 (2011)
3. Brandstädt, A., Dragan, F.F., Le, H.O., Le, V.B.: Tree spanners on chordal graphs: complexity and algorithms. Theoret. Comput. Sci. 310(1–3), 329–354 (2004)
4. Chang, Y.W., Jacobson, M.S., Monma, C.L., West, D.B.: Subtree and substar intersection numbers. Discret. Appl. Math. 44(1–3), 205–220 (1993)
5. Corneil, D.G., Perl, Y.: Clustering and domination in perfect graphs. Discret. Appl. Math. 9(1), 27–39 (1984)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献