Funder
Natural Sciences and Engineering Research Council of Canada
National Natural Science Foundation of China
China Scholarship Council
The Grant-in-Aid for Scientific Research of the Ministry of Education, Science, Sports and Culture of Japan
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference27 articles.
1. Acharya, H.B., Choi, T., Bazzi, R.A., Gouda, M.G.: The $$k$$-observer problem in computer networks. Netw. Sci. 1, 15–22 (2012)
2. Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237, 123–134 (2000)
3. Berman, P., Fujito, T.: On approximation properties of the independent set problem for degree $$3$$ graphs. In: Proceedings of the Fourth International Workshop on Algorithms and Data Structures (WADS’95), LNCS 955, pp. 449–460 (1995)
4. Boliac, R., Cameron, K., Lozin, V.: On computing the dissociation number and the induced matching number of bipartite graphs. Ars Combinatoria 72, 241–253 (2004)
5. Brešar, B., Krivoš-Belluš, R., Semanišin, G., Šparl, P.: On the weighted $$k$$-path vertex cover problem. Discrete Appl. Math. 177, 14–18 (2014)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献