Author:
Edelman Alan,Hassidim Avinatan,Nguyen Huy N.,Onak Krzysztof
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Dinur, I., Safra, S.: On the hardness of approximating minimum vertex cover. Annals of Mathematics 162(1), 439–485 (2005)
2. Bodlaender, H.: Dynamic programming on graphs with bounded treewidth. In: Automata, Languages and Programming, pp. 105–118 (1988)
3. Robertson, N., Seymour, P.: Graph minors. III. Planar tree-width. Journal of Combinatorial Theory, Series B 36(1), 49–64 (1984)
4. Robertson, N., Seymour, P.: Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms 7(3), 309–322 (1986)
5. Bodlaender, H.: A tourist guide through treewidth. Developments in Theoretical Computer Science (1994) 1
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献