{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T19:08:12Z","timestamp":1648753692051},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1986,12,1]],"date-time":"1986-12-01T00:00:00Z","timestamp":533779200000},"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":[[1986,12]]},"DOI":"10.1007\/bf02251094","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T16:34:46Z","timestamp":1132072486000},"page":"365-370","source":"Crossref","is-referenced-by-count":0,"title":["An appraisal of the performance of the MMSC subgraph generation algorithm on a Cyber System 170\/720"],"prefix":"10.1007","volume":"37","author":[{"given":"S. R.","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Y.","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02251094_CR1","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1109\/TEC.1959.5222697","volume":"8","author":"M. C. Paull","year":"1959","unstructured":"Paull, M. C., Unger, S. H.: Minimizing the number of states in incompletely specified sequential switching functions. IRE Trans.EC-8, 356\u2013367 (1959).","journal-title":"IRE Trans."},{"key":"BF02251094_CR2","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":"BF02251094_CR3","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1145\/321607.321608","volume":"17","author":"J. G. Augustson","year":"1970","unstructured":"Augustson, J. G., Minker, J.: An analysis of some graph theoretical cluster techniques. J. ACM17, 571\u2013588 (1970).","journal-title":"J. ACM"},{"key":"BF02251094_CR4","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1109\/T-C.1973.223683","volume":"22","author":"S. R. Das","year":"1973","unstructured":"Das, S. R.: On a new approach for finding all the modified cut-sets in an incompatibility graph. IEEE Trans.C-22, 187\u2013193 (1973).","journal-title":"IEEE Trans. C"},{"key":"BF02251094_CR5","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Finding all cliques of an undirected graph. Comm. ACM16, 575\u2013577 (1973).","journal-title":"Comm. ACM"},{"key":"BF02251094_CR6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0045-7906(79)90002-8","volume":"6","author":"S. R. Das","year":"1979","unstructured":"Das, S. R., Sheng, C. L., Chen, Z., Lin, T.: Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs. Comp. Elec. Engg.6, 139\u2013151 (1979).","journal-title":"Comp. Elec. Engg."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02251094.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02251094\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02251094","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T17:48:38Z","timestamp":1557942518000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02251094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,12]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1986,12]]}},"alternative-id":["BF02251094"],"URL":"https:\/\/doi.org\/10.1007\/bf02251094","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,12]]}}}