{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:57:43Z","timestamp":1760245063526},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"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":["Information Sciences"],"published-print":{"date-parts":[[1978,1]]},"DOI":"10.1016\/0020-0255(78)90041-5","type":"journal-article","created":{"date-parts":[[2003,10,9]],"date-time":"2003-10-09T04:36:33Z","timestamp":1065674193000},"page":"181-187","source":"Crossref","is-referenced-by-count":3,"title":["Strong connectivity in symmetric graphs and generation of maximal minimally strongly connected subgraphs"],"prefix":"10.1016","volume":"14","author":[{"given":"S.R.","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.L.","family":"Sheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(78)90041-5_BIB1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0041-1647(68)90016-6","article-title":"Scheduling of traffic lights\u2014a new approach","volume":"2","author":"Stoffers","year":"1968","journal-title":"Transportation Res."},{"key":"10.1016\/0020-0255(78)90041-5_BIB2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1109\/T-C.1974.223786","article-title":"Sequential algorithm for the determination of maximum compatibles","volume":"C-23","author":"Stoffers","year":"1974","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0020-0255(78)90041-5_BIB3","first-page":"729","article-title":"On finding maximum compatibles","volume":"63","author":"Nieminen","year":"1975"},{"key":"10.1016\/0020-0255(78)90041-5_BIB4","first-page":"694","article-title":"On finding maximum compatibles","volume":"57","author":"Das","year":"1969"},{"key":"10.1016\/0020-0255(78)90041-5_BIB5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1109\/T-C.1973.223683","article-title":"On a new approach for finding all the modified cut-sets in an incompatibility graph","volume":"C-22","author":"Das","year":"1973","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0020-0255(78)90041-5_BIB6","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1145\/321328.321332","article-title":"Analysis of graphs by connectivity considerations","volume":"13","author":"Ramamoorthy","year":"1966","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0255(78)90041-5_BIB7","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1109\/TEC.1959.5222697","article-title":"Minimizing the number of states in incompletely specified sequential switching functions","volume":"EC-8","author":"Paull","year":"1959","journal-title":"IRE Trans. Electron. Comput."},{"key":"10.1016\/0020-0255(78)90041-5_BIB8","doi-asserted-by":"crossref","first-page":"608","DOI":"10.2307\/2310823","article-title":"Boolean algebra, map coloring, and interconnections","volume":"69","author":"Weissman","year":"1962","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0020-0255(78)90041-5_BIB9","series-title":"Linear Graphs and Electrical Networks","author":"Seshu","year":"1961"},{"key":"10.1016\/0020-0255(78)90041-5_BIB10","series-title":"Graph Theory","author":"Harary","year":"1969"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025578900415?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025578900415?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T15:52:02Z","timestamp":1550850722000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025578900415"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,1]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1978,1]]}},"alternative-id":["0020025578900415"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(78)90041-5","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1978,1]]}}}