Author:
Smith J. Cole,Ulusal Elif,Hicks Illya V.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Control and Optimization
Reference19 articles.
1. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308–340 (1991)
2. Bian, Z., Gu, Q., Marzban, M., Tamaki, H., Yoshitake, Y.: Empirical study on branchwidth and branch decomposition of planar graphs. In: Proceedings of the 2008 SIAM Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 152–165. SIAM, Philadelphia (2008)
3. Lecture Notes in Computer Science;H.L. Bodlaender,2006
4. Bodlaender, H.L., Koster, A.M.C.A., Wolle, T.: Contraction and treewidth lower bounds. J. Graph Algorithms Appl. 10(1), 5–49 (2006)
5. Cook, W.J., Seymour, P.D.: An algorithm for the ring-router problem. Technical report, Bellcore (1994)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献