{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:31Z","timestamp":1725664051449},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540562795"},{"type":"electronic","value":"9783540475019"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56279-6_54","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:57:46Z","timestamp":1330253866000},"page":"21-30","source":"Crossref","is-referenced-by-count":0,"title":["Linear time algorithms for k-cutwidth problem"],"prefix":"10.1007","author":[{"given":"Maw-Hwa","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sing-Ling","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"issue":"No.2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/0219025","volume":"19","author":"A. Aggarwal","year":"1990","unstructured":"Alok Aggarwal, Richard J. Anderson, and Ming Yanf Kao, \u201cParallel Depth-First search in general directed graphs,\u201d SIAM J. Comput., Vol. 19, No. 2, April 1990, pp. 397\u2013409.","journal-title":"SIAM J. Comput."},{"key":"3_CR2","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"C. Berge, Graphs and Hypergraphs, North-Holland, Amsterdam 1973."},{"key":"3_CR3","volume-title":"Distance in Graphs","author":"F. Buckley","year":"1990","unstructured":"F. Buckley and F. Harary, Distance in Graphs, Addison-Wesley, Reading, 1990."},{"issue":"No.2","key":"3_CR4","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0606026","volume":"6","author":"F. R. K. Chung","year":"1985","unstructured":"Fan R. K. Chung, \u201cOn the Cutwidth and the Topological Bandwidth of a Tree,\u201d SIAM J. Alg. Disc. Meth., Vol. 6, No. 2, April 1985, pp. 268\u2013277.","journal-title":"SIAM J. Alg. Disc. Meth."},{"issue":"No.1","key":"3_CR5","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1137\/0214013","volume":"14","author":"M. J. Chung","year":"1985","unstructured":"M. J. Chung, F. Makedon, I. H. Sudborough and J. Tarner, \u201dPolynomial algorithm for the min-cut linear arrangement problem on degree restricted trees,\u201d SIAM J. Comput., Vol. 14, No. 1, 1985, pp. 158\u2013177.","journal-title":"SIAM J. Comput."},{"issue":"No.1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TCAD.1985.1270101","volume":"CAD-4","author":"A. E. Dunlop","year":"1985","unstructured":"A. E. Dunlop and B. W. Kernighan, \u201dA Procedure for Placement of Standard-Cell VLSI Circuits,\u201d IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, Vol. CAD-4, No. 1, Jan. 1985, pp. 92\u201398.","journal-title":"IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems"},{"key":"3_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey, D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Franciso 1979."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1016\/0196-6774(84)90006-3","volume":"5","author":"E. Gurari","year":"1984","unstructured":"E. Gurari, and I. H. Sudborough, \u201dImproved dynamic programming algorithms for bandwidth minimization and min-cut linear arrangement problem,\u201d J. Algorithms, Vol. 5, 1984, pp. 531\u2013546.","journal-title":"J. Algorithms"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science 319","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BFb0040373","volume-title":"Proc. 3rd Aegean Workship on Computing, Corfu, Greece","author":"M. Y. Kao","year":"1988","unstructured":"M. Y. Kao, \u201dAll graphs have cycle separators and planar directed depth-first search is in DNC,\u201d in Proc. 3rd Aegean Workship on Computing, Corfu, Greece, J. H. Reif, ed.; Lecture Notes in Computer Science 319, Springer-Verlay, Berlin, New York, 1988, pp. 53\u201363."},{"issue":"No.1","key":"3_CR10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/0603010","volume":"3","author":"T. Lengauer","year":"1982","unstructured":"Thomas Lengauer, \u201dUpper and Lower Bounds on the Complexity of the Min-Cut Linear Arrangement Problem on Trees,\u201d SIAM J. Alg. Disc. Meth., Vol. 3, No. 1, March 1982, pp. 99\u2013113.","journal-title":"SIAM J. Alg. Disc. Meth."},{"issue":"8","key":"3_CR11","doi-asserted-by":"crossref","first-page":"1671","DOI":"10.1109\/T-ED.1980.20086","volume":"ED-27","author":"A. D. Lopez","year":"1980","unstructured":"A. D. Lopez, and H. F. S. Law, \u201dA Dense Gate Matrix Layout Method for MOS VLSI,\u201d IEEE Trans. on Electronic Devices, ED-27, 8, 1980, pp. 1671\u20131675.","journal-title":"IEEE Trans. on Electronic Devices"},{"issue":"No.3","key":"3_CR12","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0606044","volume":"6","author":"F. S. Makedon","year":"1985","unstructured":"F. S. Makedon, C. H. Papadimitriou and I. H. Sudborough, \u201dTopological Bandwidth,\u201d SIAM J. Alg. Disc. Meth., Vol. 6, No. 3, July 1985, pp. 418\u2013444.","journal-title":"SIAM J. Alg. Disc. Meth."},{"issue":"No.5","key":"3_CR13","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0190(79)90075-9","volume":"9","author":"S. L. Mitchell","year":"1979","unstructured":"Sanda L. Mitchell, \u201dLinear Algorithms to Recognize Oulplanar and Maximal Outerplanar Graphs,\u201d Information Processing Letters, Vol. 9, No. 5, December 1979, pp. 229\u2013232.","journal-title":"Information Processing Letters"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1109\/TCS.1979.1084695","volume":"26","author":"T. H. Ohtsuki","year":"1979","unstructured":"T. H. Ohtsuki, H. Mori, E. S. Kuh, T. Kashiwabara and T. Fujiswa, \u201dOne Dimensional Logic Gate Assignment and Interval Graphs,\u201d IEEE Trans. Circuits and Systems, Vol. 26, 1979, pp. 675\u2013684.","journal-title":"IEEE Trans. Circuits and Systems"},{"issue":"No.10","key":"3_CR15","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1109\/TC.1983.1676134","volume":"C-32","author":"A. L. Rosenberg","year":"1983","unstructured":"A. L. Rosenberg, \u201dThe Diogenes Approach to Testable Fault-Tolerant Arrays of Processors,\u201d IEEE Trans. on Computers, Vol. C-32, No. 10, Oct. 1983, pp. 902\u2013910.","journal-title":"IEEE Trans. on Computers"},{"issue":"No.4","key":"3_CR16","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","volume":"14","author":"R. E. Tarjan","year":"1985","unstructured":"R. E. Tarjan, \u201dAn Efficient Parallel Biconnectivity Algorithm,\u201d SIAM J. Comput., Vol. 14, No. 4, November 1985, pp. 862\u2013874.","journal-title":"SIAM J. Comput."},{"issue":"No.4","key":"3_CR17","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1145\/4221.4228","volume":"32","author":"M. Yannakakis","year":"1985","unstructured":"M. Yannakakis, \u201dA Polynomial Algorithm for the Min Cut Linear Arrangement of Trees,\u201d J. ACM., Vol. 32, No. 4, 1985, pp. 950\u2013988.","journal-title":"J. ACM."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56279-6_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:48:47Z","timestamp":1619570927000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56279-6_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540562795","9783540475019"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-56279-6_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}