Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference20 articles.
1. Barbero, F., Isenmann, L., Thiebaut, J.: On the distance identifying set meta-problem and applications to the complexity of identifying problems on graphs. In: Algorithmica, Special Issue on Parameterized and Exact Computation, IPEC 2018, Vol. 155, No. 17, pp. 2242–2256 (2007)
2. Bensmail, J., Inerney, F.M., Nisse, N.: Metric dimension: from graphs to oriented graphs. In: Electronic Notes in Theoretical Computer Science, The proceedings of Lagos 2019, the tenth Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2019), Vol. 346, pp. 111–123 (2019)
3. Boesch, F.T., Chen, S., McHugh, N.A.M.: On covering the points of a graph with point disjoint paths. In: Graphs and Combinatorics, Number 406 in Lecture Notes in Math, pp. 201–212 (1974)
4. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. Elsevier, New York (1976)
5. Bousquet, N., Deschamps, Q., Lehtilä, T., Parreau, A.: Locating-dominating sets: From graphs to oriented graphs. Discret. Math. 346(1), 113124 (2023)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献