{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:34:43Z","timestamp":1725496483303},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540668565"},{"type":"electronic","value":"9783540466741"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46674-6_29","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T10:50:17Z","timestamp":1196333417000},"page":"347-358","source":"Crossref","is-referenced-by-count":2,"title":["Separators Are as Simple as Cutsets"],"prefix":"10.1007","author":[{"given":"Hong","family":"Shen","sequence":"first","affiliation":[]},{"given":"Keqin","family":"Li","sequence":"additional","affiliation":[]},{"given":"Si-Qing","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,11,19]]},"reference":[{"issue":"3","key":"29_CR1","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1109\/TCT.1972.1083456","volume":"CT-19","author":"H. Ariyoshi","year":"1972","unstructured":"H. Ariyoshi, Cut-set graph and systematic generation of separating sets, IEEE Trans. Circuit Theory CT-19(3) (1972) 233\u2013240.","journal-title":"IEEE Trans. Circuit Theory"},{"key":"29_CR2","unstructured":"S. Arnberg, Efficient algorithms for combinatorial problems on graphs with bounded decomposability-A survey, BIT 25 (1985) 2\u201323."},{"key":"29_CR3","unstructured":"A. Gibbons, Algorithmic Graph Theory, Cambridge Univ. Press, 1985."},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"L.A. Goldberg, Efficient Algorithms for Listing Combinatorial Structures, Cambridge Univ. Press, 1993.","DOI":"10.1017\/CBO9780511569913"},{"key":"29_CR5","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980."},{"issue":"8","key":"29_CR6","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/359138.359141","volume":"22","author":"D.S. Hirschberg","year":"1979","unstructured":"D.S. Hirschberg, A.K. Chandra and D.V. Sarwate, Computing connected components on parallel computers, Commu. ACM 22(8) (1979) 461\u2013464.","journal-title":"Commu. ACM"},{"key":"29_CR7","unstructured":"A. Kanevsky, On the number of minimum size separating vertex sets in a graph and how to find all of them, Proc. 1st Ann. ACM-SIAM Symp. Discrete Algorithms (1990) 411\u2013421."},{"key":"29_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1007\/3-540-57785-8_188","volume-title":"Proc. Theoretical Aspects of Computer Sci","author":"T. Kloks","year":"1994","unstructured":"T. Kloks and D. Kratsh, Finding all minimal separators of a graph, Proc. Theoretical Aspects of Computer Sci. LNCS 775 (1994) 759\u2013767."},{"key":"29_CR9","unstructured":"D.E. Knuth, The Art of Computer Programming, Vol 3: Sorting and Searching, Addison-Wesley, 1973."},{"key":"29_CR10","unstructured":"E.M. Reingold, J. Nievergelt and N. Deo, Combinatorial Algorithms: Theory and Practice, Prentice-Hall, Englewood Cliffs (1977)."},{"key":"29_CR11","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0304-3975(97)83809-1","volume":"180","author":"H. Shen","year":"1997","unstructured":"H. Shen and W. Liang, Efficient enumeration of all minimal separators in a graph, Theoretical Computer Science 180 (1997) 169\u2013180.","journal-title":"Theoretical Computer Science"},{"key":"29_CR12","unstructured":"H. Shen, K. Li and S.Q. Zheng, Separators are as simple as cutsets (long version), manuscript."},{"issue":"4","key":"29_CR13","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1145\/322217.322220","volume":"27","author":"S. Tsukiyama","year":"1980","unstructured":"S. Tsukiyama, I. Shirakawa and H. Ozaki, An algorithm to enumerate all cutsets of a graph in linear time per cutest, J. ACM 27(4) (1980) 619\u2013632.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Computing Science \u2014 ASIAN\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46674-6_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T21:09:50Z","timestamp":1548364190000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46674-6_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540668565","9783540466741"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46674-6_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}