Author:
Bian Zhengbing,Gu Qian-Ping
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Public Implementation of a Graph Algorithm Library and Editor (2008),
http://pigale.sourceforge.net/
2. The LEDA User Manual, Algorithmic Solutions, Version 4.2.1 (2008),
http://www.mpi-inf.mpg.de/LEDA/MANUAL/MANUAL.html
3. Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embedding in a k-tree. SIAM J. on Discrete Mathematics 8, 277–284 (1987)
4. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. Journal of Algorithms 12, 308–340 (1991)
5. Bian, Z., Gu, Q., Marzban, M., Tamaki, H., Yoshitake, Y.: Empirical study on branchwidth and branch decomposition of planar graphs. In: Proc. of the 9th SIAM Workshop on Algorithm Engineering and Experiments (ALENEX 2008), pp. 152–165 (2008)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献