Author:
Dujmović Vida,Morin Pat,Wood David R.
Publisher
Springer Berlin Heidelberg
Reference38 articles.
1. H. L. Bodlaender, A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput., 25(6):1305–1317, 1996.
2. H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci., 209(1–2):1–45, 1998.
3. F. J. Brandenburg, ed., Proc. International Symp. on Graph Drawing (GD’ 95), vol. 1027 of Lecture Notes in Comput. Sci., Springer, 1996.
4. I. Bruß and A. Frick, Fast interactive 3-D graph visualization. In [3], pp. 99–110.
5. T. Calamoneri and A. Sterbini, 3D straight-line grid drawing of 4-colorable graphs. Inform. Process. Lett., 63(2):97–102, 1997.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献