Author:
Liu Xianliang,Lu Hongliang,Wang Wei,Wu Weili
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Management Science and Operations Research,Control and Optimization,Computer Science Applications
Reference14 articles.
1. Brešar B., Kardoš F., Katrenič J., Semanišin G.: Minimum k-path vertex cover. Discrete Appl. Math. 159, 1189–1195 (2011)
2. Cheng X., Huang X., Li D., Wu W., Du D.: A polynomial-time approximation scheme for minimum connected dominating set in ad hoc wireless networks. Networks 42, 202–208 (2003)
3. Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1978)
4. Gollmann, D.: Protocol Analysis for Concrete Environments, EUROCAST 2005. LNCS, vol. 3643, pp. 365–372. Springer, Heidelberg (2005)
5. Kratochvil, K.: Intersection graphs of noncrossing arc-connected sets in the plane. In: Proceedings of Symposium on Graph Drawing, GD’96. LNCS, vol. 1190, pp. 257–270 (1997)
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献