Author:
Bai Guoqiang,Fernau Henning
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Bai, G.: Ein eingeschränktes Knotenüberdeckungsproblem in bipartiten Graphen. Diplomarbeit, FB IV, Informatik, Universität Trier, Germany (2007)
2. Blough, D.M.: On the reconfiguration of memory arrays containing clustered faults. In: Fault Tolerant Computing, pp. 444–451. IEEE Press, Los Alamitos (1991)
3. Blough, D.M., Pelc, A.: A clustered failure model for the memory array reconfiguration problem. IEEE Transactions on Computers 42(5), 518–528 (1993)
4. Chen, J., Kanj, I.A.: Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithmics. Journal of Computer and System Sciences 67, 833–847 (2003)
5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献