Author:
Aoki Yusuke,Halldórsson Bjarni V.,Halldórsson Magnús M.,Ito Takehiro,Konrad Christian,Zhou Xiao
Publisher
Springer International Publishing
Reference10 articles.
1. Lecture Notes in Computer Science;S Assadi,2012
2. Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25, 1305–1317 (1996)
3. Boutiche, M.A., Ait Haddadène, H., Le Thi, H.A.: Maintaining graph properties of weakly chordal graphs. Appl. Math. Sci. 6, 765–778 (2012)
4. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. SIAM, Philadelphia (1999)
5. Even, G., Kortsarz, G., Slany, W.: On network design problems: fixed cost flows and the covering steiner problem. ACM Trans. Algorithms 1, 74–101 (2005)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献