A combinatorial algorithm and its application in computing all minimum toll sets of graphs.
Samer NofalPublished in: Open Comput. Sci. (2023)
Keyphrases
- computational complexity
- detection algorithm
- computational cost
- dynamic programming
- learning algorithm
- spanning tree
- k means
- global minimum
- cost function
- recognition algorithm
- times faster
- objective function
- minimum spanning tree
- square error
- graph construction
- graph search
- graph model
- subgraph isomorphism
- dominating set
- convergence rate
- expectation maximization
- worst case
- probabilistic model
- np hard
- significant improvement
- search space
- lower bound
- preprocessing
- optimal solution