Affiliation:
1. Department of Computer Science, German Jordanian University , Amman , Jordan
Abstract
Abstract
This article formalizes an algorithm that computes the minimum toll sets in an undirected graph. A core process in our algorithm is to check vertex subsets in order of size. We add a new flavor to the implementation of this process; when the
k
−
1
k-1
-vertex subsets are already constructed, our algorithm produces the
k
k
-vertex subsets building on the
k
−
1
k-1
-vertex subsets rather than reconstructing the
k
k
-vertex subsets from the ground up as the existing algorithms would do. Our implementation is usable in combinatorial minimization problems that require checking variable-size combinations in order of size.
Reference19 articles.
1. L. Alcón, B. Brešar, T. Gologranc, M. Gutierrez, T. K. Šumenjak, I. Peterin, and A. Tepeh, “Toll convexity,” European Journal of Combinatorics, vol. 46, pp. 161–175, 2015.
2. M. C. Dourado, “Computing the hull number in toll convexity,” Annals of Operations Research, vol. 315, no. 1, pp. 121–140, 2022.
3. T. Gologranc and P. Repolusk, “Toll number of the strong product of graphs,” Discrete Mathematics, vol. 342, no. 3, pp. 807–814, 2019.
4. T. Gologranc and P. Repolusk, “Toll number of the cartesian and the lexicographic product of graphs,” Discrete Mathematics, vol. 340, no. 10, pp. 2488–2498, 2017.
5. R. L. Arco and S. R. Canoy Jr, “Forcing toll convexity numbers of some products of graphs,” Advances and Applications in Mathematical Sciences, vol. 17, no. 5, pp. 401–416, 2018.