A combinatorial algorithm and its application in computing all minimum toll sets of graphs
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−1k-1-vertex subsets are already constructed, our algorit...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2023-12-01
|
| Series: | Open Computer Science |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/comp-2023-0103 |