Author:
Arnborg Stefan,Proskurowski Andrzej
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Computer Networks and Communications,Software
Reference30 articles.
1. A. V. Aho, J. E. Hopcroft and J. D. Ullman,Design and Analysis of Computer Algorithms, Addison-Wesley (1972).
2. S. Arnborg,Efficient algorithms for combinatorial problems on graphs with bounded decomposability — a survey, BIT 25(1985), 2–33.
3. S. Arnborg, D. G. Corneil and A. Proskurowski,Complexity of finding embeddings in a k-tree, SIAM J. Alg. and Discr. Methods 8(1987), 277–287.
4. S. Arnborg, B. Courcelle, A. Proskurowski and D. Seese,An algebraic theory of graph reduction, submitted.
5. S. Arnborg and A. Proskurowski,Characterization and recognition of partial 3-trees, SIAM J. Alg. and Discr. Methods 7(1986), 305–314.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献