Author:
Marathe M. V.,Ravi R.,Sundaram R.,Ravi S. S.,Rosenkrantz D. J.,Hunt H. B.
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. S. Arnborg, J. Lagergren and D. Seese, “Easy Problems for Tree-Decomposable Graphs,” J. Algorithms, Vol. 12, 1991, pp. 308–340.
2. S. Arnborg, B. Courcelle, A. Proskurowski and D. Seese, “An Algebraic Theory of Graph Problems,” J. ACM, Vol. 12, 1993, pp. 308–340.
3. B. Awerbuch, A. Baratz, and D. Peleg, “Cost-sensitive analysis of communication protocols,” Proc. of 9th Symp. on Principles of Distributed Computing (PODC), pp. 177–187, (1990).
4. M. Bellare, S. Goldwasser, C. Lund, and A. Russell, “Efficient probabilistically checkable proofs,” Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (1993), pp. 294–304.
5. M.W. Bern, E.L. Lawler and A.L. Wong, “Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs,” J. Algorithms, Vol. 8, 1987, pp. 216–235.
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献