Author:
Adler Isolde,Bui-Xuan Binh-Minh,Rabinovich Yuri,Renault Gabriel,Telle Jan Arne,Vatshelle Martin
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Bodlaender, H., Koster, A.: Treewidth Computations I Upper Bounds. Technical Report UU-CS-2008-032, Department of Information and Computing Sciences, Utrecht University (2008)
2. LNCS;B.-M. Bui-Xuan,2009
3. Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discrete Applied Mathematics 158(7), 809–819 (2010)
4. Corneil, D., Rotics, U.: On the relationship between clique-width and treewidth. SIAM Journal on Computing 34(4), 825–847 (2005)
5. Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp. 193–242 (1990)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献