{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T15:49:49Z","timestamp":1698335389024},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1979,12,1]],"date-time":"1979-12-01T00:00:00Z","timestamp":312854400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1979,12]]},"DOI":"10.1007\/bf02248731","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T04:24:19Z","timestamp":1132028659000},"page":"295-322","source":"Crossref","is-referenced-by-count":36,"title":["Clique detection for nondirected graphs: Two new algorithms"],"prefix":"10.1007","volume":"21","author":[{"given":"L.","family":"Gerhards","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Lindenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02248731_CR1","first-page":"23","volume":"11","author":"A. R. Bednarek","year":"1966","unstructured":"Bednarek, A. R., Taulbee, O. E.: On maximal chains. Roum. Math. Pures et Appl.11, 23\u201325 (1966).","journal-title":"Roum. Math. Pures et Appl."},{"key":"BF02248731_CR2","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph. Collected algorithms from CACM (Algorithm 457). 1971."},{"key":"BF02248731_CR3","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1093\/comjnl\/14.1.38","volume":"14","author":"N. Christofides","year":"1971","unstructured":"Christofides, N.: An algorithm for the chromatic number of a graph. The Comp. J.14, 38 (1971).","journal-title":"The Comp. J."},{"key":"BF02248731_CR4","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/0022-247X(69)90233-9","volume":"25","author":"S. L. Hakimi","year":"1969","unstructured":"Hakimi, S. L., Frank, H.: Maximum internally stable sets of a graph. J. of Math. Anal. and Appl.25, 296 (1969).","journal-title":"J. of Math. Anal. and Appl."},{"key":"BF02248731_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.2307\/2785673","volume":"20","author":"F. Harary","year":"1957","unstructured":"Harary, F., Ross, I. C.: A procedure for clique detection using the group matrix. Sociometry20, 205\u2013215 (1957).","journal-title":"Sociometry"},{"key":"BF02248731_CR6","unstructured":"Johnson, L. F.: Determining cliques of a graph. Proc. of the fifth Conf. on Num. Math.1957, 429\u2013437."},{"key":"BF02248731_CR7","volume-title":"On construction of all maximal complete subgraphs (cliques) of a graph","author":"L. J. Leifman","year":"1976","unstructured":"Leifman, L. J.: On construction of all maximal complete subgraphs (cliques) of a graph. Preprint, Dept. of Math., Univ. Haifa, Israel, 1976."},{"key":"BF02248731_CR8","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0771-050X(75)90035-2","volume":"1","author":"W. Meeusen","year":"1975","unstructured":"Meeusen, W., Cuyvers, L.: Clique detection in directed graphs: a new algorithm. J. of Comp. and Appl. Math.1, 185\u2013193 (1975).","journal-title":"J. of Comp. and Appl. Math."},{"key":"BF02248731_CR9","first-page":"3522","volume":"248","author":"K. H. Maghout","year":"1959","unstructured":"Maghout, K. H.: Sur la d\u00e9termination des nombres de stabilit\u00e9 et du nombre chromatique d'un graph. C. r. Acad. Sci. (Paris)248, 3522\u20133523 (1959).","journal-title":"C. r. Acad. Sci. (Paris)"},{"key":"BF02248731_CR10","doi-asserted-by":"crossref","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.3, 23\u201328 (1965).","journal-title":"Israel J. Math."},{"key":"BF02248731_CR11","unstructured":"Peay, E. R., jr.: An iterative clique detection procedure. Michigan Math. Psychol. Program: MMPP 70-4 (1970)."},{"key":"BF02248731_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-7091-2301-0","volume-title":"Methoden der angewandten Graphentheorie","author":"G. Tinhofer","year":"1976","unstructured":"Tinhofer, G.: Methoden der angewandten Graphentheorie (Kapitel 2, Algorithmus 8). Wien-New York: Springer 1976."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02248731.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02248731\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02248731","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T14:41:30Z","timestamp":1558017690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02248731"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,12]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1979,12]]}},"alternative-id":["BF02248731"],"URL":"https:\/\/doi.org\/10.1007\/bf02248731","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,12]]}}}