Author:
Bezáková Ivona,Chambers Erin W.,Fox Kyle
Publisher
Springer International Publishing
Reference19 articles.
1. S. Arnborg, D. Corneil, A. Proskurowski, Complexity of finding embeddings in a k-tree. SIAM J. Algebr. Discret. Methods 8(2), 277–284 (1987). http://epubs.siam.org/doi/abs/10.1137/0608024
2. M.O. Ball, S.J. Provan, Calculating bounds on reachability and connectedness in stochastic networks. Networks 13, 253–278 (1983)
3. I. Bezáková, A.J. Friedlander, Counting and sampling minimum $$(s, t)$$ ( s , t ) -cuts in weighted planar graphs in polynomial time. Theoret. Comput. Sci. 417, 2–11 (2012)
4. H. Bodlaender, A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996). http://epubs.siam.org/doi/abs/10.1137/S0097539793251219
5. H.L. Bodlaender, Dynamic programming on graphs with bounded treewidth, in Automata, Languages and Programming, vol. 317, Lecture Notes in Computer Science, ed. by T. Lepistö, A. Salomaa (Springer, Berlin, 1988), pp. 105–118
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献