Author:
Johnson Thor,Robertson Neil,Seymour P.D.,Thomas Robin
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference18 articles.
1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Alg. Disc. & Meth.,1987
2. Linear time algorithms for NP-hard problems on graphs embedded in k-trees;Arnborg;Discrete Appl. Math.,1989
3. Quickly excluding a forest;Bienstock;J. Combin. Theory Ser. B,1991
4. Monotonicity in graph searching;Bienstock;J. Algorithms,1991
5. W. Cook, and, P. D. Seymour, An algorithm for the ring-router problem, unpublished manuscript, 1993.
Cited by
178 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献