Author:
Bergougnoux Benjamin,Kanté Mamadou Moustapha,Kwon O-Joung
Publisher
Springer International Publishing
Reference9 articles.
1. Arnborg, S., Proskurowski, A.: Linear time algorithms for NP-hard problems restricted to partial $$k$$ -trees. Discrete Appl. Math. 23, 11–24 (1989)
2. Bodlaender, H.L.: A partial $$k$$ -arboretum of graphs with bounded treewidth. Theor. Comput. Sci. 209, 1–45 (1998)
3. Courcelle, B.: The monadic second-order logic of graphs I: Recognizable sets of finite graphs. Information and Computation 85, 12–75 (1990)
4. Courcelle, B., Makowsky, J.A., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique width. Theor. Comput. Sci. 33, 125–150 (2000)
5. Courcelle, B., Olariu, S.: Upper bounds to the clique width of graphs. Discrete Appl. Math. 101(1–3), 77–114 (2000)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献