{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T01:37:05Z","timestamp":1726364225681},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228561"},{"type":"electronic","value":"9783540277989"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27798-9_19","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T23:01:28Z","timestamp":1283727688000},"page":"161-170","source":"Crossref","is-referenced-by-count":33,"title":["The Worst-Case Time Complexity for Generating All Maximal Cliques"],"prefix":"10.1007","author":[{"given":"Etsuji","family":"Tomita","sequence":"first","affiliation":[]},{"given":"Akira","family":"Tanaka","sequence":"additional","affiliation":[]},{"given":"Haruhisa","family":"Takahashi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Akutsu, T., Hayashida, M., Tomita, E., Suzuki, J., Horimoto, K.: Protein threading with profiles and constraints. In: Proc. IEEE Symp. on Bioinformatics and Bioengineering (2004) (to appear)","DOI":"10.1109\/BIBE.2004.1317389"},{"key":"19_CR2","first-page":"143","volume":"13","author":"D. Bahadur","year":"2002","unstructured":"Bahadur, D., Akutsu, K.C.T., Tomita, E., Seki, T., Fujiyama, A.: Point matching under non-uniform distortions and protein side chain packing based on efficient maximum clique algorithms. Genome Informatics\u00a013, 143\u2013152 (2002)","journal-title":"Genome Informatics"},{"key":"19_CR3","unstructured":"Bahadur, D., Akutsu, K.C.T., Tomita, E., Seki, T.: Protein side-chain packing: A maximum edge weight clique algorithmic approach. In: Proc. Asia-Pacific Bioinformatics Conf., pp. 191\u2013200 (2004)"},{"key":"19_CR4","first-page":"1","volume-title":"Handbook of Combinatorial Optimization","author":"M. Bomze","year":"1999","unstructured":"Bomze, M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization\u00a0Supplement vol. A, pp. 1\u201374. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"19_CR5","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, Comm. ACM\u00a016, 575\u2013577 (1973)","journal-title":"ACM"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Comput\u00a014, 210\u2013223 (1985)","journal-title":"SIAM J. Comput"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"11853","DOI":"10.1021\/ja036030u","volume":"125","author":"M. Hattori","year":"2003","unstructured":"Hattori, M., Okuno, Y., Goto, S., Kanehisa, M.: Development of a chemical structure comparison method for integrated analysis of chemical and genomic information in the metabolic pathways. J. Am. Chem. Soc.\u00a0125, 11853\u201311865 (2003)","journal-title":"J. Am. Chem. Soc."},{"key":"19_CR8","unstructured":"Kobayashi, S., Kondo, T., Okuda, K., Tomita, E.: Extracting globally structure free sequences by local structure freeness. In: Proc. DNA9, p. 206 (2003)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1137\/0209042","volume":"9","author":"E.L. Lawler","year":"1980","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Generating all maximal independent sets, NP-hardness and polynomial-time algorithms. SIAM J. Comput.\u00a09, 558\u2013565 (1980)","journal-title":"SIAM J. Comput."},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1093\/nar\/gkh040","volume":"32","author":"S. Mohseni-Zadeh","year":"2004","unstructured":"Mohseni-Zadeh, S., Louis, A., Br\u00e9zellec, P., Risler, J.-L.: PHYTOPROT: a database of clusters of plant proteins. Nucleic Acids Res.\u00a032, D351\u2013D353 (2004)","journal-title":"Nucleic Acids Res."},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J.W. Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Israel J. Math.\u00a03, 23\u201328 (1965)","journal-title":"Israel J. Math."},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-45066-1_22","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"E. Tomita","year":"2003","unstructured":"Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a maximum clique. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol.\u00a02731, pp. 278\u2013289. Springer, Heidelberg (2003)"},{"key":"19_CR13","unstructured":"Tomita, E., Tanaka, A., Takahashi, H.: An optimal algorithm for finding all the cliques, Technical Report of IPSJ, 1989-AL-12, pp. 91\u201398 (1989)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0206036","volume":"6","author":"S. Tsukiyama","year":"1977","unstructured":"Tsukiyama, S., Ide, M., Ariyoshi, H., Shirakawa, I.: A new algorithm for generating all the maximal independent sets. SIAM J. Comput.\u00a06, 505\u2013517 (1977)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27798-9_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:26:30Z","timestamp":1620012390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27798-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228561","9783540277989"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27798-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}