Author:
Dujmović Vida,Suderman Matthew,Wood David R.
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Bodlaender, H.L.: A partial k-arboretum of graphs with bounded treewidth. Theoret. Comput. Sci. 209(1-2), 1–45 (1998)
2. Ding, G., Oporowski, B.: Some results on tree decomposition of graphs. J. Graph Theory 20(4), 481–499 (1995)
3. Dujmović, V., Suderman, M., Wood, D.R.: Really straight graph drawings. arXiv.org:cs.DM/0405112 (2004)
4. Dujmović, V., Wood, D.R.: On linear layouts of graphs. Discrete Math. Theor. Comput. Sci. 6(2), 339–358 (2004)
5. Duncan, C.A., Eppstein, D., Kobourov, S.G.: The geometric thickness of low degree graphs. In: Proc. 20th ACM Symp. on Computational Geometry (SoCG 2004), pp. 340–346. ACM Press, New York (2004)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献