Author:
Bian Zhengbing,Gu Qian-Ping,Zhu Mingzhe
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference26 articles.
1. Complexity of finding embedding in a k-tree;Arnborg;SIAM J. Discrete. Math.,1987
2. Easy problems for tree-decomposable graphs;Arnborg;J. Algorithms,1991
3. Z. Bian, Q. Gu, Computing branch decompositions of large planar graphs, in: Proc. of the 7th International Workshop on Experimental Algorithms, WEA 2008, in: LNCS, vol. 5038, 2008, pp. 87–100.
4. Z. Bian, Q. Gu, M. Marzban, H. Tamaki, Y. Yoshitake, Empirical study on branchwidth and branch decomposition of planar graphs, in: Proc. of the 9th SIAM Workshop on Algorithm Engineering and Experiments, ALENEX’08, 2008, pp. 152–165.
5. A tourist guide through treewidth;Bodlaender;Acta Cybern.,1993
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献