{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:40Z","timestamp":1759638280371},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0196-6774(92)90012-2","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"161-174","source":"Crossref","is-referenced-by-count":17,"title":["Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph"],"prefix":"10.1016","volume":"13","author":[{"given":"Toshinobu","family":"Kashiwabara","sequence":"first","affiliation":[]},{"given":"Sumio","family":"Masuda","sequence":"additional","affiliation":[]},{"given":"Kazuo","family":"Nakajima","sequence":"additional","affiliation":[]},{"given":"Toshio","family":"Fujisawa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(92)90012-2_BIB1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1137\/0201008","article-title":"The transitive reduction of a directed graph","volume":"1","author":"Aho","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(92)90012-2_BIB2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1972"},{"key":"10.1016\/0196-6774(92)90012-2_BIB3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0020-0190(87)90007-X","article-title":"Finding maximum cliques on circular-arc graphs","volume":"26","author":"Apostolico","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0196-6774(92)90012-2_BIB4","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","article-title":"Arboricity and subgraph listing algorithms","volume":"14","author":"Chiba","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(92)90012-2_BIB5","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1137\/0211038","article-title":"On the asymptotic complexity of matrix manipulation","volume":"11","author":"Coppersmith","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(92)90012-2_BIB6","series-title":"Proceedings, 4th Annual Princeton Conf. on Information Sciences and Systems","first-page":"459","article-title":"On finding a maximum internally stable set of a graph","author":"Desler","year":"1970"},{"key":"10.1016\/0196-6774(92)90012-2_BIB7","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230040407","article-title":"Algorithms on circular-arc graphs","volume":"1","author":"Gavril","year":"1974","journal-title":"Networks"},{"key":"10.1016\/0196-6774(92)90012-2_BIB8","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0196-6774(92)90012-2_BIB9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n2.5 algorithm for maximum matching in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(92)90012-2_BIB10","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/0196-6774(84)90037-3","article-title":"Fast algorithms for generating all maximal independent sets of interval, circular-arc, and chordal graphs","volume":"5","author":"Leung","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(92)90012-2_BIB11","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/net.3230200203","article-title":"Efficient algorithms for finding maximum cliques of an overlap graph","volume":"20","author":"Masuda","year":"1990","journal-title":"Networks"},{"key":"10.1016\/0196-6774(92)90012-2_BIB12","article-title":"Efficient Enumeration of Maximal and Maximum Independent Sets of an Interval Graph and a Circular-Arc Graph","author":"Masuda","year":"1987"},{"key":"10.1016\/0196-6774(92)90012-2_BIB13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/net.3230110305","article-title":"Finding maximum cliques in circle graphs","volume":"11","author":"Rotem","year":"1981","journal-title":"Networks"},{"key":"10.1016\/0196-6774(92)90012-2_BIB14","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1145\/322217.322220","article-title":"An algorithm to enumerate all cutsets of a graph in linear time per cutset","volume":"27","author":"Tsukiyama","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0196-6774(92)90012-2_BIB15","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1137\/0206036","article-title":"A new algorithm for generating all the maximal independent sets","volume":"6","author":"Tsukiyama","year":"1977","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677492900122?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677492900122?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T06:53:34Z","timestamp":1548744814000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677492900122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["0196677492900122"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(92)90012-2","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}