Author:
Chen Zhi-Zhong,Tanahashi Ruka,Wang Lusheng
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. Approximating maximum edge coloring in multigraphs;Feige,2002
2. H.N. Gabow, An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems, in: Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 448–456
3. D. Hartvigsen, Extensions of matching theory, Ph.D. Thesis, Carnegie-Mellon University, 1984
4. Approximation Algorithms for NP-Hard Problems;Hochbaum,1997
5. Complexity of recognizing equal unions in families of sets;Jacobs;Journal of Algorithms,2000
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献