Loading...

A new distributed learning automata based algorithm for maximum independent set problem

Daliri Khomami, M. M ; Sharif University of Technology

651 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/RIOS.2016.7529512
  3. Publisher: Institute of Electrical and Electronics Engineers Inc
  4. Abstract:
  5. Maximum independent set problem is an NP-Hard one with the aim of finding the set of independent vertices with maximum possible cardinality in a graph. In this paper, we investigate a learning automaton based algorithm that finds a maximum independent set in the graph. Initially, a learning automaton is assigned to each vertex of graph. In order to find candidate independent set, a set of distributed learning automata collaborate with each other. The proposed algorithm based on learning automata is guided iteratively to the maximum independent set by updating the action probability vector. In order to study the performance of the proposed algorithm, we conducted some experiments. The reported numerical results confirm the superiority of our proposed algorithm in terms of cardinality of the obtained solution
  6. Keywords:
  7. Distributed learning automata ; Maximum independent set ; NP-Hard problems ; Artificial intelligence ; Automata theory ; Computational complexity ; Distributed computer systems ; Graph theory ; Iterative methods ; Robotics ; Set theory ; Cardinalities ; Distributed learning automaton ; Independent set ; Learning Automata ; NP-hard ; Numerical results ; Probability vector ; Learning algorithms
  8. Source: 2016 Artificial Intelligence and Robotics, 9 April 2016 ; 2016 , Pages 12-17 ; 9781509021697 (ISBN)
  9. URL: http://ieeexplore.ieee.org/document/7529512