A distributed algorithm for a maximal 2-packing set in Halin graphs.
Alejandro Flores-LamasJosé Alberto Fernández-ZepedaJoel Antonio Trejo-SánchezPublished in: J. Parallel Distributed Comput. (2020)
Keyphrases
- packing problem
- optimization algorithm
- cost function
- initial set
- solution space
- learning algorithm
- convex hull
- np hard
- detection algorithm
- worst case
- input data
- undirected graph
- random graphs
- preprocessing
- segmentation algorithm
- computational cost
- k means
- computational complexity
- optimal solution
- decision trees
- graph partitioning
- neural network
- polynomial time complexity
- graph isomorphism
- hyper graph
- hamiltonian cycle
- graph structure
- bipartite graph
- knapsack problem
- clustering method
- dynamic programming
- genetic algorithm