{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T19:38:49Z","timestamp":1649187529606},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1007\/bf01990522","type":"journal-article","created":{"date-parts":[[2005,8,4]],"date-time":"2005-08-04T14:55:06Z","timestamp":1123167306000},"page":"390-395","source":"Crossref","is-referenced-by-count":1,"title":["AnO(n 2) algorithm for finding the compact sets of a graph"],"prefix":"10.1007","volume":"33","author":[{"given":"Chiou-Kuo","family":"Liang","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01990522_CR1","volume-title":"Graph Algorithms","author":"S. Even","year":"1987","unstructured":"S. Even,Graph Algorithms, Computer Science Press, Rockville, Maryland, 1987."},{"issue":"1","key":"BF01990522_CR2","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J. B. Kruskal Jr.","year":"1956","unstructured":"J. B. Jr. Kruskal,On the shortest spanning subtree of a graph and the traveling salesman problem, Proceedings of the American Mathematical Society, Vol. 7, No. 1, 1956, pp. 48\u201350.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"BF01990522_CR3","doi-asserted-by":"crossref","unstructured":"R. C. Prim,Shortest connection networks and some generalizations, Bell System Technical Journal, 1957, pp. 1389\u20131401.","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"issue":"1","key":"BF01990522_CR4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/0020-0190(82)90137-5","volume":"14","author":"R. E. Tarjan","year":"1982","unstructured":"R. E. Tarjan,Sensitivity analysis of minimal spanning trees and shortest path trees, Information Processing Letters, Vol. 14, No. 1, 1982, pp. 30\u201333.","journal-title":"Information Processing Letters"},{"key":"BF01990522_CR5","doi-asserted-by":"crossref","unstructured":"R. E. Tarjan,Data Structures and Network Algorithms, Society for Industrial and Applied Mathematics, 1983.","DOI":"10.1137\/1.9781611970265"},{"issue":"6","key":"BF01990522_CR6","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0020-0190(91)90092-V","volume":"38","author":"D. Zivkovic","year":"1991","unstructured":"D. Zivkovic,A fast algorithm for finding the compact sets, Information Processing Letters, Vol. 38, No. 6, 1991, pp. 339\u2013342.","journal-title":"Information Processing Letters"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01990522.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01990522\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01990522","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T21:47:02Z","timestamp":1557784022000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01990522"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["BF01990522"],"URL":"https:\/\/doi.org\/10.1007\/bf01990522","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}