{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T08:47:54Z","timestamp":1747644474035,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319265605"},{"type":"electronic","value":"9783319265612"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26561-2_63","type":"book-chapter","created":{"date-parts":[[2015,11,17]],"date-time":"2015-11-17T03:15:22Z","timestamp":1447730122000},"page":"531-539","source":"Crossref","is-referenced-by-count":3,"title":["Characterisation of Cognitive Activity Using Minimum Connected Component"],"prefix":"10.1007","author":[{"given":"Ramasamy","family":"Vijayalakshmi","sequence":"first","affiliation":[]},{"given":"D.","family":"Nandagopal","sequence":"additional","affiliation":[]},{"given":"M.","family":"Thilaga","sequence":"additional","affiliation":[]},{"given":"Bernie","family":"Cocks","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,18]]},"reference":[{"key":"63_CR1","doi-asserted-by":"crossref","unstructured":"Sporns, O., Tononi, G., Kotter, R.: The human connectome: A structural description of the human brain. PLOS ONE. 1 (4) (2005)","DOI":"10.1371\/journal.pcbi.0010042"},{"key":"63_CR2","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.neuron.2011.09.006","volume":"72","author":"JD Power","year":"2011","unstructured":"Power, J.D., Cohen, A.L., Nelsom, S.M., Wig, G.S., Barnes, K.A., Church, J.A.: Functional network organization of the human brain. Neuron 72, 665\u2013678 (2011)","journal-title":"Neuron"},{"key":"63_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.03.092","author":"R Vijayalakshmi","year":"2015","unstructured":"Vijayalakshmi, R., Nandagopal, D., Dasari, N., Cocks, B., Thilaga, M.: Minimum connected component - a novel approach to detection of cognitive load induced changes in functional brain networks. Neurocomputing (2015). doi: 10.1016\/j.neucom.2015.03.092","journal-title":"Neurocomputing"},{"issue":"2","key":"63_CR4","first-page":"1348","volume":"2","author":"PL Nunez","year":"2002","unstructured":"Nunez, P.L.: Electroencephalography. Encyclopedia of Human. Brain 2(2), 1348 (2002)","journal-title":"Brain"},{"issue":"1","key":"63_CR5","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363(1), 28\u201342 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"7043","key":"63_CR6","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G Palla","year":"2005","unstructured":"Palla, G., Dernyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435(7043), 814\u2013818 (2005)","journal-title":"Nature"},{"key":"63_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-20662-7_31","volume-title":"Experimental Algorithms","author":"D Eppstein","year":"2011","unstructured":"Eppstein, D., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 364\u2013375. Springer, Heidelberg (2011)"},{"key":"63_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-642-20662-7_31","volume-title":"Experimental Algorithms","author":"D Eppstein","year":"2011","unstructured":"Eppstein, D., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 364\u2013375. Springer, Heidelberg (2011)"},{"issue":"9","key":"63_CR9","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: Finding all cliques of an undirected graph. Commun. ACM 16(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"issue":"1","key":"63_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E Tomita","year":"2006","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theor. Comput. Sci. 363(1), 28\u201342 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"63_CR11","volume-title":"Social network analysis: Methods and applications","author":"K Faust","year":"1995","unstructured":"Faust, K., Wasserman, S.: Social network analysis: Methods and applications. Cambridge University Press, Cambridge (1995)"},{"issue":"2","key":"63_CR12","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1016\/j.csda.2004.02.004","volume":"48","author":"V Boginski","year":"2005","unstructured":"Boginski, V., Butenko, S., Pardalos, P.M.: Statistical analysis of financial networks. Comput. Stat. Data Anal. 48(2), 431\u2013443 (2005)","journal-title":"Comput. Stat. Data Anal."},{"issue":"2","key":"63_CR13","first-page":"175","volume":"115","author":"G Dumermuth","year":"1974","unstructured":"Dumermuth, G.: Quantification and analysis of the EEG. Schweiz. Arch. Neurol. Neurochir. Psychiatr. 115(2), 175\u2013192 (1974)","journal-title":"Schweiz. Arch. Neurol. Neurochir. Psychiatr."},{"issue":"1","key":"63_CR14","first-page":"9","volume":"134","author":"A Delorme","year":"2004","unstructured":"Delorme, A., Makeig, S.: EEGLAB: An open source toolbox for the analysis of single-trial EEG dynamics including independent component analysis. NCBI 134(1), 9\u201321 (2004)","journal-title":"NCBI"},{"key":"63_CR15","first-page":"115","volume":"30","author":"D Nandagopal","year":"2015","unstructured":"Nandagopal, D., Vijayalakshmi, R., Cocks, B., Dahal, N., Dasari, N., Thilaga, M.: Computational neuroengineering Approaches to characterising cognitive activity in EEG data. Knowl. Based Inf. Syst. Pract. Smart Innovation Knowl. Syst. Technol. 30, 115\u2013137 (2015)","journal-title":"Knowl. Based Inf. Syst. Pract. Smart Innovation Knowl. Syst. Technol."},{"key":"63_CR16","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1097\/WCO.0b013e32833aa567","volume":"23","author":"Y He","year":"2010","unstructured":"He, Y., Evans, A.: Graph theoretical modeling of brain connectivity. Curr. Opin. Neurol. 23, 341\u2013350 (2010)","journal-title":"Curr. Opin. Neurol."},{"key":"63_CR17","unstructured":"CURRY 7 EEG Acquisition and Analysis Software. Compumedics Neuroscan USA Ltd"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26561-2_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T08:23:17Z","timestamp":1653553397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26561-2_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319265605","9783319265612"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26561-2_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}