{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:52:54Z","timestamp":1761947574051},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2009,10,1]],"date-time":"2009-10-01T00:00:00Z","timestamp":1254355200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1007\/s12293-009-0019-6","type":"journal-article","created":{"date-parts":[[2009,9,30]],"date-time":"2009-09-30T10:04:19Z","timestamp":1254305059000},"page":"281-290","source":"Crossref","is-referenced-by-count":5,"title":["Solving maximum fuzzy clique problem with neural networks and its applications"],"prefix":"10.1007","volume":"1","author":[{"given":"Malay","family":"Bhattacharyya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanghamitra","family":"Bandyopadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,10,1]]},"reference":[{"key":"19_CR1","unstructured":"Bandyopadhyay S, Bhattacharyya M (2008) Mining the Largest Dense N-vertexlet in a Fuzzy Scale-free Graph. Technical Report No.- MIU\/TR-03\/08. Machine Intelligence Unit, Indian Statistical Institute, Kolkata, India"},{"key":"19_CR2","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/978-3-642-02490-0_74","volume-title":"Advances in neuro-information processing, LNCS 5506","author":"S Bandyopadhyay","year":"2009","unstructured":"Bandyopadhyay S, Bhattacharyya M (2009) A neuro-GA approach for the maximum fuzzy clique problem. In: K\u00f6eppen M, Kasabov N, Coghill G (eds) Advances in neuro-information processing, LNCS 5506. Springer, Heidelberg, pp 605\u2013612"},{"issue":"2","key":"19_CR3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F Barahona","year":"1989","unstructured":"Barahona F, Junger M, Reinelt G (1989) Experiments in quadratic 0\u20131 programming. Math Program 44(2): 127\u2013137","journal-title":"Math Program"},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of combinatorial optimization: supplementary volume A","author":"IM Bomze","year":"1999","unstructured":"Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem. In: Du DZ, Pardalos PM (eds) Handbook of combinatorial optimization: supplementary volume A. Kluwer Academic, Dordrecht, pp 1\u201374"},{"key":"19_CR5","volume-title":"Theory of computational complexity","author":"DZ Du","year":"2000","unstructured":"Du DZ, Ko KI (2000) Theory of computational complexity. Wiley, New York"},{"key":"19_CR6","unstructured":"Goldberg DE (2005) Genetic algorithms in search, optimization & machine learning. Pearson Education, Ninth Indian Reprint, India"},{"issue":"1","key":"19_CR7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s12293-008-0001-8","volume":"1","author":"G Gutin","year":"2009","unstructured":"Gutin G, Karapetyan D (2009) A selection of useful theoretical tools for the design and analysis of optimization heuristics. J Memetic Comput 1(1): 25\u201334","journal-title":"J Memetic Comput"},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad J (1999) Clique is hard to approximate within n 1\u2013\u03b5 . Acta Math 182: 105\u2013142","journal-title":"Acta Math"},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00339943","volume":"52","author":"JJ Hopfield","year":"1985","unstructured":"Hopfield JJ, Tank DW (1985) Neural computation of decisions in optimization problems. Biol Cybern 52: 141\u2013152","journal-title":"Biol Cybern"},{"key":"19_CR10","first-page":"11","volume":"26","author":"DS Johnson","year":"1993","unstructured":"Johnson DS, Trick MA, Johnson DJ (1993) Cliques, coloring, and satisfiability: second dimacs implementation challenge. Dimacs Ser Discrete Math Theor Comput Sci 26: 11\u201313","journal-title":"Dimacs Ser Discrete Math Theor Comput Sci"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Lee KC, Funabiki N, Cho YB, Takefuji Y (1991) A parallel neural network computing for the maximum clique problem. In: Proceedings of the international joint conference on neural networks, Singapore, pp 905\u2013910","DOI":"10.1109\/IJCNN.1991.170515"},{"issue":"1","key":"19_CR12","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/72.105427","volume":"3","author":"KC Lee","year":"1992","unstructured":"Lee KC, Funabiki N, Takefuji Y (1992) A parallel improvement algorithm for the bipartite subgraph problem. IEEE Trans Neural Netw 3(1): 139\u2013145","journal-title":"IEEE Trans Neural Netw"},{"key":"19_CR13","volume-title":"First course on fuzzy theory and applications","author":"KH Lee","year":"2005","unstructured":"Lee KH (2005) First course on fuzzy theory and applications. Springer, Berlin"},{"key":"19_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-7908-1854-3","volume-title":"Fuzzy graphs and fuzzy hypergraphs","author":"JN Mordeson","year":"2000","unstructured":"Mordeson JN, Nair PS (2000) Fuzzy graphs and fuzzy hypergraphs. Physica-Verlag, Heidelberg"},{"key":"19_CR15","unstructured":"Palshikar GK, Bahulkar A (2000) Fuzzy temporal patterns for analysing stock market databases. In: Proceedings of the international conference on advances in data management, Pune, India, pp 135\u2013142"},{"key":"19_CR16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/s10618-007-0076-8","volume":"16","author":"GK Palshikar","year":"2008","unstructured":"Palshikar GK, Apte MM (2008) Collusion set detection using graph clustering. Data Mining Knowl Discov 16: 135\u2013164","journal-title":"Data Mining Knowl Discov"},{"key":"19_CR17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/B978-0-12-775260-0.50008-6","volume-title":"Fuzzy sets and their applications to cognitive and decision processes","author":"A Rosenfeld","year":"1975","unstructured":"Rosenfeld A (1975) Fuzzy graphs. In: Tanaka K, Zadeh LA, Fu KS, Shimura M (eds) Fuzzy sets and their applications to cognitive and decision processes. Academic Press, New York, pp 77\u201395"},{"key":"19_CR18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0377-0427(87)90125-7","volume":"20","author":"P Rousseeuw","year":"1987","unstructured":"Rousseeuw P (1987) Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J Comput Appl Math 20: 53\u201365","journal-title":"J Comput Appl Math"},{"key":"19_CR19","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/j.neucom.2004.01.001","volume":"57","author":"J Wang","year":"2004","unstructured":"Wang J, Tang Z, Wang R (2004) Maximum neural network with nonlinear self-feedback for maximum clique problem. Neurocomputing 57: 485\u2013492","journal-title":"Neurocomputing"},{"issue":"7","key":"19_CR20","first-page":"1953","volume":"E87-D","author":"J Wang","year":"2004","unstructured":"Wang J, Tang Z, Wang R (2004) A chaotic maximum neural network for maximum clique problem. IEICE Trans Inf Syst E87-D(7): 1953\u20131961","journal-title":"IEICE Trans Inf Syst"},{"key":"19_CR21","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1073\/pnas.95.1.334","volume":"95","author":"X Wen","year":"1998","unstructured":"Wen X, Fuhrman S, Michaels GS, Carr DB, Smith S, Barker JL, Somogyi R (1998) Large-scale temporal gene expression mapping of central nervous system development. Proce Natl Acad Sci USA 95: 334\u2013339","journal-title":"Proce Natl Acad Sci USA"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Yang G, Yi J, Gao S, Tang Z (2007) An improved transiently chaotic neural network with multiple chaotic dynamics for maximum clique problem. In: Proceedings of the second international conference on innovative computing, informatio and control, Washington, DC, p 275","DOI":"10.1109\/ICICIC.2007.152"},{"issue":"2","key":"19_CR23","first-page":"1","volume":"7","author":"G Yang","year":"2007","unstructured":"Yang G, Tang Z, Yi J (2007) An improved chaotic maximum neural network for maximum clique problem. Int J Comput Sci Netw Secur 7(2): 1\u20137","journal-title":"Int J Comput Sci Netw Secur"},{"issue":"5","key":"19_CR24","first-page":"1213","volume":"5","author":"J Yi","year":"2009","unstructured":"Yi J, Yang G, Gao S, Tang Z (2009) A shrinking chaotic maximum neural network for maximum clique problem. Int J Innov Comput Inf Control 5(5): 1213\u20131229","journal-title":"Int J Innov Comput Inf Control"},{"key":"19_CR25","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"LA Zadeh","year":"1965","unstructured":"Zadeh LA (1965) Fuzzy sets. Inf Control 8: 338\u2013353","journal-title":"Inf Control"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-009-0019-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-009-0019-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-009-0019-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T23:46:46Z","timestamp":1685144806000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-009-0019-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,1]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2009,12]]}},"alternative-id":["19"],"URL":"https:\/\/doi.org\/10.1007\/s12293-009-0019-6","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,1]]}}}