{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T19:55:14Z","timestamp":1648929314718},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1992,11,1]],"date-time":"1992-11-01T00:00:00Z","timestamp":720576000000},"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 Processing Letters"],"published-print":{"date-parts":[[1992,11]]},"DOI":"10.1016\/0020-0190(92)90189-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"79-83","source":"Crossref","is-referenced-by-count":0,"title":["Not all planar diagraphs have small cycle separators"],"prefix":"10.1016","volume":"44","author":[{"given":"Ming-Yang","family":"Kao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fang","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90189-3_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02122548","article-title":"A random NC algorithm for depth first search","volume":"8","author":"Aggarwal","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/0020-0190(92)90189-3_BIB2","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/0219025","article-title":"Parallel depth-first search in general directed graphs","volume":"19","author":"Aggarwal","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90189-3_BIB3","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1137\/0218058","article-title":"Efficient message routing in planar networks","volume":"18","author":"Frederickson","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90189-3_BIB4","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1137\/0219011","article-title":"Space-efficient message routing in c-decomposable networks","volume":"19","author":"Frederickson","year":"1990","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90189-3_BIB5","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1137\/0217028","article-title":"A nearly optimal parallel algorithm for constructing depth first spanning trees in planar graphs","volume":"17","author":"He","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90189-3_BIB6","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1109\/31.1743","article-title":"Parallel algorithms for planar graphs and related problems","volume":"35","author":"Ja'Ja","year":"1988","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/0020-0190(92)90189-3_BIB7","first-page":"259","article-title":"Partition of planar flow networks","author":"Johnson","year":"1983","journal-title":"Proc. 24th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(92)90189-3_BIB8","series-title":"Proc. 3rd Aegean Workshop on Computing","first-page":"53","article-title":"All graphs have cycle separators and planar directed depth-first search is in DNC","volume":"319","author":"Kao","year":"1988"},{"key":"10.1016\/0020-0190(92)90189-3_BIB9","series-title":"ACM Doctoral Dissertation Award Series","article-title":"Area-Efficient Graph Layouts (for VLSI)","author":"Leiserson","year":"1983"},{"key":"10.1016\/0020-0190(92)90189-3_BIB10","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0022-0000(88)90047-5","article-title":"Simulating two pushdown stores by one tape in o(n1.5log n) time","volume":"37","author":"Li","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(92)90189-3_BIB11","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1137\/0716027","article-title":"Generalized nested dissection","volume":"16","author":"Lipton","year":"1979","journal-title":"SIAM J. Numer. Anal."},{"key":"10.1016\/0020-0190(92)90189-3_BIB12","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1137\/0209046","article-title":"Applications of a planar separator theorem","volume":"9","author":"Lipton","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90189-3_BIB13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0022-0000(86)90030-9","article-title":"Finding small simple cycle separators for 2-connected planar graphs","volume":"32","author":"Miller","year":"1986","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(92)90189-3_BIB14","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1016\/0022-0000(89)90013-5","article-title":"Fast and efficient solution of path algebra problems","volume":"38","author":"Pan","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(92)90189-3_BIB15","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(88)90048-8","article-title":"A linear-processor algorithm for depth-first search in planar graphs","volume":"29","author":"Shannon","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90189-3_BIB16","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1137\/0215058","article-title":"Parallel algorithms for depth first search I. Planar graphs","volume":"15","author":"Smith","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90189-3_BIB17","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1109\/TC.1981.6312176","article-title":"University considerations in VLSI circuits","volume":"30","author":"Valiant","year":"1981","journal-title":"IEEE Trans. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019092901893?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019092901893?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:29:11Z","timestamp":1555144151000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019092901893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,11]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,11]]}},"alternative-id":["0020019092901893"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90189-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,11]]}}}