Publisher
Springer International Publishing
Reference26 articles.
1. Auger D., Charon I., Hudry O., Lobstein A.: Complexity results for identifying codes in planar graphs. International Transactions in Operational Research 17(6), pp. 691–10 (2010).
2. Bazgan C., Foucaud F., Sikora F.: Parameterized and Approximation Complexity of Partial VC Dimension, Theoretical Computer Science 766(25), pp. 1–15 (2019).
3. Berge C..:Theory of Graphs and its Applications. Methuen, London (1962)). RI, 1962.
4. Bousquet N.: Hitting sets: VC-dimension and Multicuts. Université Montpellier II-Sciences et Techniques du Languedoc (2013).
5. Bousquet N., Lagoutte A., Li Z., Parreau A., Thomasse A.: Identifying codes in hereditary classes of graphs and VC-dimension. SIAM Journal on Discrete Mathematics 29(4), pp. 2047–2064 (2015).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献