Author:
Burrage Kevin,Estivill-Castro Vladimir,Fellows Michael,Langston Michael,Mac Shev,Rosamond Frances
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Abu-Khzam, F.N., Collins, R.L., Fellows, M.R., Langston, M.A., Suters, W.H., Symons, C.T.: Kernelization algorithms for the vertex cover problem: theory and experiments. In: Arge, L., Italiano, G., Sedgewick, R. (eds.) Proceedings of the 6th Workshop on Algorithm Engineering and Experiments (ALENEX) Proc. Applied Mathematics 115, New Orleans, January 2004. ACM/SIAM (2004)
2. Alber, J., Fellows, M., Niedermeier, R.: Polynomial time data reduction for dominating set. Journal of the ACM 51, 363–384 (2004)
3. Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM Journal on Discrete Mathematics 12, 289–297 (1999)
4. Becker, A., Bar-Yehuda, R., Geiger, D.: Random algorithms for the loop cutset problem. Journal of Artificial Intelligence Research 12, 219–234 (2000)
5. Bodlaender, H., Koster, A., van den Eijkhof, F.: Preprocessing rules for triangulation of probabilistic networks. Computational Intelligence 21, 286–305 (2005)
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献