메뉴 건너뛰기




Volumn , Issue , 2012, Pages 115-119

Solving maximum clique problem in stochastic graphs using learning automata

Author keywords

learning automata; maximum clique problem; NP Hard; social networks; stochastic graph

Indexed keywords

LEARNING AUTOMATA; MAXIMUM CLIQUE PROBLEMS; NP-HARD; SOCIAL NETWORKS; STOCHASTIC GRAPHS;

EID: 84874032727     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CASoN.2012.6412388     Document Type: Conference Paper
Times cited : (15)

References (17)
  • 1
    • 79960196899 scopus 로고    scopus 로고
    • Cliques with maximum/minimum edge neighborhood and neighborhood density
    • P. Martins, "Cliques with maximum/minimum edge neighborhood and neighborhood density," Computers & Operations Research, vol. 39, no. 3, pp. 594-608, 2012.
    • (2012) Computers & Operations Research , vol.39 , Issue.3 , pp. 594-608
    • Martins, P.1
  • 2
    • 84863201478 scopus 로고    scopus 로고
    • Multi-neighborhood tabu search for the maximum weight clique problem
    • Q. Wu, J.-K. Hao, and F. Glover, "Multi-neighborhood tabu search for the maximum weight clique problem," Annals of Operations Research, vol. 196, no. 1, pp. 611-634, 2012.
    • (2012) Annals of Operations Research , vol.196 , Issue.1 , pp. 611-634
    • Wu, Q.1    Hao, J.-K.2    Glover, F.3
  • 3
    • 80455176990 scopus 로고    scopus 로고
    • On the scalability of biocomputing algorithms: The case of the maximum clique problem
    • D. Manrique, A. Rodríguez-Patón, and P. Sosík, "On the scalability of biocomputing algorithms: The case of the maximum clique problem," Theoretical Computer Science, vol. 412, no. 51, pp. 7075-7086, 2011.
    • (2011) Theoretical Computer Science , vol.412 , Issue.51 , pp. 7075-7086
    • Manrique, D.1    Rodríguez-Patón, A.2    Sosík, P.3
  • 4
    • 82455162306 scopus 로고    scopus 로고
    • R-EVO: A reactive evolutionary algorithm for the maximum clique problem
    • M. Brunato and R. Battiti, "R-EVO: A Reactive Evolutionary Algorithm for the Maximum Clique Problem," IEEE Transactions on Evolutionary Computation, vol. 15, no. 6, pp. 770-782, 2011.
    • (2011) IEEE Transactions on Evolutionary Computation , vol.15 , Issue.6 , pp. 770-782
    • Brunato, M.1    Battiti, R.2
  • 5
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • R. M. Karp, "Reducibility among combinatorial problems," Complexity of Computer Computations, vol. 40, no. 4, pp. 85-103, 1972.
    • (1972) Complexity of Computer Computations , vol.40 , Issue.4 , pp. 85-103
    • Karp, R.M.1
  • 6
    • 84864535112 scopus 로고    scopus 로고
    • Incremental K-clique clustering in dynamic social networks
    • D. Duan, Y. Li, R. Li, and Z. Lu, "Incremental K-clique clustering in dynamic social networks," Artificial Intelligence Review, vol. 38, no. 2, pp. 129-147, 2012.
    • (2012) Artificial Intelligence Review , vol.38 , Issue.2 , pp. 129-147
    • Duan, D.1    Li, Y.2    Li, R.3    Lu, Z.4
  • 7
    • 80054920244 scopus 로고    scopus 로고
    • CLICOM: Cliques for combining multiple clusterings
    • S. Mimaroglu and M. Yagci, "CLICOM: Cliques for combining multiple clusterings," Expert Systems With Applications, vol. 39, no. 2, pp. 1889-1901, 2011.
    • (2011) Expert Systems with Applications , vol.39 , Issue.2 , pp. 1889-1901
    • Mimaroglu, S.1    Yagci, M.2
  • 9
    • 84868286348 scopus 로고    scopus 로고
    • A novel community detection algorithm for privacy preservation in social networks
    • A. Abraham, Ed. Springer Berlin Heidelberg
    • F. Amiri, N. Yazdani, H. Faili, and A. Rezvanian, "A Novel Community Detection Algorithm for Privacy Preservation in Social Networks," in Intelligent Informatics, vol. 18, A. Abraham, Ed. Springer Berlin Heidelberg, 2013, pp. 443-450.
    • (2013) Intelligent Informatics , vol.18 , pp. 443-450
    • Amiri, F.1    Yazdani, N.2    Faili, H.3    Rezvanian, A.4
  • 11
    • 77957010421 scopus 로고    scopus 로고
    • LACAIS: Learning automata based cooperative artificial immune system for function optimization
    • S. Ranka, Ed. Springer Berlin Heidelberg
    • A. Rezvanian and M. R. Meybodi, "LACAIS: Learning Automata based Cooperative Artificial Immune System for Function Optimization," in Contemporary Computing, vol. 94, S. Ranka, Ed. Springer Berlin Heidelberg, 2010, pp. 64-75.
    • (2010) Contemporary Computing , vol.94 , pp. 64-75
    • Rezvanian, A.1    Meybodi, M.R.2
  • 12
    • 78650765237 scopus 로고    scopus 로고
    • Tracking extrema in dynamic environments using a learning automata-based immune algorithm
    • T. Kim, Ed. Springer Berlin Heidelberg
    • A. Rezvanian and M. R. Meybodi, "Tracking Extrema in Dynamic Environments Using a Learning Automata-Based Immune Algorithm," in Grid and Distributed Computing, Control and Automation, vol. 121, T. Kim, Ed. Springer Berlin Heidelberg, 2010, pp. 216-225.
    • (2010) Grid and Distributed Computing, Control and Automation , vol.121 , pp. 216-225
    • Rezvanian, A.1    Meybodi, M.R.2
  • 14
    • 84855663477 scopus 로고    scopus 로고
    • A learning automatabased heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs
    • J. Akbari Torkestani and M. R. Meybodi, "A learning automatabased heuristic algorithm for solving the minimum spanning tree problem in stochastic graphs," The Journal of Supercomputing, vol. 59, no. 2, pp. 1035-1054, 2012.
    • (2012) The Journal of Supercomputing , vol.59 , Issue.2 , pp. 1035-1054
    • Torkestani, J.A.1    Meybodi, M.R.2
  • 15
    • 84860290983 scopus 로고    scopus 로고
    • Finding minimum weight connected dominating set in stochastic graph based on learning automata
    • J. Akbari Torkestani and M. R. Meybodi, "Finding minimum weight connected dominating set in stochastic graph based on learning automata," Information Sciences, vol. 200, no. 1, pp. 57-77, 2012.
    • (2012) Information Sciences , vol.200 , Issue.1 , pp. 57-77
    • Torkestani, J.A.1    Meybodi, M.R.2
  • 16
    • 79956157430 scopus 로고    scopus 로고
    • Learning automata-based algorithms for solving stochastic minimum spanning tree problem
    • J. A. Torkestani and M. R. Meybodi, "Learning automata-based algorithms for solving stochastic minimum spanning tree problem," Applied Soft Computing, vol. 11, no. 6, pp. 4064-4077, 2011.
    • (2011) Applied Soft Computing , vol.11 , Issue.6 , pp. 4064-4077
    • Torkestani, J.A.1    Meybodi, M.R.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.