{"id":"https://openalex.org/W2001789602","doi":"https://doi.org/10.1109/cason.2012.6412388","title":"Solving maximum clique problem in stochastic graphs using learning automata","display_name":"Solving maximum clique problem in stochastic graphs using learning automata","publication_year":2012,"publication_date":"2012-11-01","ids":{"openalex":"https://openalex.org/W2001789602","doi":"https://doi.org/10.1109/cason.2012.6412388","mag":"2001789602"},"language":"en","primary_location":{"id":"doi:10.1109/cason.2012.6412388","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cason.2012.6412388","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030602436","display_name":"Mohammad Soleimani-Pouri","orcid":null},"institutions":[{"id":"https://openalex.org/I197220011","display_name":"Qazvin Islamic Azad University","ror":"https://ror.org/023kjn321","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I197220011"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Mohammad Soleimani-Pouri","raw_affiliation_strings":["Department of Electrical, Islamic Azad University, Qazvin, Iran","Department of Electrical, Computer & Biomedical Engineering, Qazvin branch, Islamic Azad University, Qazvin, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Electrical, Islamic Azad University, Qazvin, Iran","institution_ids":["https://openalex.org/I197220011"]},{"raw_affiliation_string":"Department of Electrical, Computer & Biomedical Engineering, Qazvin branch, Islamic Azad University, Qazvin, Iran","institution_ids":["https://openalex.org/I197220011"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036944228","display_name":"Alireza Rezvanian","orcid":"https://orcid.org/0000-0003-3323-7832"},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Alireza Rezvanian","raw_affiliation_strings":["Computer Engineering & Information Technology Department, Amirkabir University of Technology, Tehran, Iran","[Computer Engineering and Information Technology Department, AmirKabir University of Technology, Tehran, Iran]"],"affiliations":[{"raw_affiliation_string":"Computer Engineering & Information Technology Department, Amirkabir University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I158248296"]},{"raw_affiliation_string":"[Computer Engineering and Information Technology Department, AmirKabir University of Technology, Tehran, Iran]","institution_ids":["https://openalex.org/I158248296"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008824437","display_name":"Mohammad Reza Meybodi","orcid":"https://orcid.org/0000-0003-3775-5565"},"institutions":[{"id":"https://openalex.org/I158248296","display_name":"Amirkabir University of Technology","ror":"https://ror.org/04gzbav43","country_code":"IR","type":"education","lineage":["https://openalex.org/I158248296"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mohammad Reza Meybodi","raw_affiliation_strings":["Computer Engineering & Information Technology Department, Amirkabir University of Technology, Tehran, Iran","[Computer Engineering and Information Technology Department, AmirKabir University of Technology, Tehran, Iran]"],"affiliations":[{"raw_affiliation_string":"Computer Engineering & Information Technology Department, Amirkabir University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I158248296"]},{"raw_affiliation_string":"[Computer Engineering and Information Technology Department, AmirKabir University of Technology, Tehran, Iran]","institution_ids":["https://openalex.org/I158248296"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030602436"],"corresponding_institution_ids":["https://openalex.org/I197220011"],"apc_list":null,"apc_paid":null,"fwci":3.3527,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.92399557,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"94","issue":null,"first_page":"115","last_page":"119"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9879000186920166,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.6078027486801147},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.49424031376838684},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.4818383455276489},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48109930753707886},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.46270090341567993},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45978856086730957},{"id":"https://openalex.org/keywords/learning-automata","display_name":"Learning automata","score":0.45816925168037415},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4568738043308258},{"id":"https://openalex.org/keywords/split-graph","display_name":"Split graph","score":0.44374707341194153},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4225919246673584},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36539894342422485},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35633552074432373},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.307422399520874},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2822228670120239},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.15277782082557678},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.15252786874771118},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.13948911428451538}],"concepts":[{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.6078027486801147},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.49424031376838684},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.4818383455276489},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48109930753707886},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.46270090341567993},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45978856086730957},{"id":"https://openalex.org/C2776807809","wikidata":"https://www.wikidata.org/wiki/Q6510160","display_name":"Learning automata","level":3,"score":0.45816925168037415},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4568738043308258},{"id":"https://openalex.org/C8554925","wikidata":"https://www.wikidata.org/wiki/Q3893853","display_name":"Split graph","level":5,"score":0.44374707341194153},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4225919246673584},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36539894342422485},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35633552074432373},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.307422399520874},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2822228670120239},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.15277782082557678},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.15252786874771118},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.13948911428451538}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cason.2012.6412388","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cason.2012.6412388","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Fourth International Conference on Computational Aspects of Social Networks (CASoN)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.418.9598","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.418.9598","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ceit.aut.ac.ir/~meybodi/paper/Soleymanipour-Rzvanian-IEEE-2012.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W55006675","https://openalex.org/W950821216","https://openalex.org/W1538558539","https://openalex.org/W1667767500","https://openalex.org/W1850230604","https://openalex.org/W1975442866","https://openalex.org/W1997887516","https://openalex.org/W1999223659","https://openalex.org/W2048753002","https://openalex.org/W2054326643","https://openalex.org/W2061901927","https://openalex.org/W2089507786","https://openalex.org/W2094836579","https://openalex.org/W2104433301","https://openalex.org/W2123419497","https://openalex.org/W2134648356","https://openalex.org/W2134828066","https://openalex.org/W2142987654","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W3121666834","https://openalex.org/W2951533720","https://openalex.org/W2794565019","https://openalex.org/W2891037262","https://openalex.org/W4300229885","https://openalex.org/W2219991221","https://openalex.org/W1487885374","https://openalex.org/W2162082186","https://openalex.org/W4285171291","https://openalex.org/W2052760902"],"abstract_inverted_index":{"The":[0,87],"maximum":[1,25,29,80],"clique":[2,30,81],"of":[3,12,52,63,104,107],"a":[4,72],"given":[5],"graph":[6,34,92],"G":[7,13,23],"is":[8,35,56,67,76],"the":[9,28,41,46,50,59,64,84,95,105],"subgraph":[10],"C":[11,19],"such":[14],"that":[15,94],"two":[16],"vertices":[17],"in":[18,22,31,83,102],"are":[20],"adjacent":[21],"with":[24],"cardinality.":[26],"Finding":[27],"an":[32,36],"arbitrary":[33],"NP-Hard":[37],"problem,":[38],"motivated":[39],"by":[40,110],"social":[42],"networks":[43],"analysis.":[44],"In":[45,69],"real":[47],"world":[48],"applications,":[49],"nature":[51],"interaction":[53],"between":[54],"nodes":[55],"stochastic":[57,85,91],"and":[58],"probability":[60],"distribution":[61],"function":[62],"vertex":[65],"weight":[66],"unknown.":[68],"this":[70],"paper":[71],"learning":[73],"automata-based":[74],"algorithm":[75,97],"proposed":[77,96],"for":[78],"solving":[79],"problem":[82],"graph.":[86],"simulation":[88],"results":[89],"on":[90],"demonstrate":[93],"outperforms":[98],"standard":[99],"sampling":[100],"method":[101],"terms":[103],"number":[106],"samplings":[108],"taken":[109],"algorithm.":[111]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}