Author:
Wang Chunhao,Gu Qian-Ping
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Lecture Notes in Computer Science;Z. Bian,2008
2. Bian, Z., Gu, Q.P., 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)
3. Bodlaender, H.L., Grigoriev, A., Koster, A.M.C.A.: Treewidth lower bounds with brambles. Algorithmica 51(1), 81–89 (2008)
4. Byers, T.H., Waterman, M.S.: Determining all optimal and near-optimal solutions when solving shortest path problems by dynamic programming. Operations Research 32(6), 1381–1384 (1984)
5. de Fraysseix, H., de Mendez, P.O.: PIGALE-Public Implementation of a Graph Algorithm Library and Editor. SourceForge project page, http://sourceforge.net/projects/pigale
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献