Author:
Călinescu Gruia,Fernandes Cristina G.,Reed Bruce
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. Proc. 33rd IEEE Symposium on Foundations of Computer Science, pages 14–23, 1992.
2. S. Arnborg and J. Lagergren. Problems easy for tree-decomposable graphs. Journal of Algorithms, 12(2):308–340, 1991.
3. E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM Journal on Computing, 23(4):864–894, 1994.
4. E. A. Dinic. Algorithm for solution of a problem of maximum flow in networks with power estimation. Soviet Mathematics Doklady, 11:1277–1280, 1970.
5. G. Even, J. S. Naor, B. Schieber, and L. Zosin. Approximating minimum subset feedback sets in undirected graphs with applications. Proc. 4th Israel Symposium on Theory of Computing and Systems, pages 78–88, 1996.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献