{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:27:23Z","timestamp":1787498843279,"version":"build-2736575974"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1994,5,1]],"date-time":"1994-05-01T00:00:00Z","timestamp":767750400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1994,5]]},"DOI":"10.1007\/bf01293266","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T17:05:16Z","timestamp":1111683916000},"page":"443-468","source":"Crossref","is-referenced-by-count":2,"title":["Finding the closed partition of a planar graph"],"prefix":"10.1007","volume":"11","author":[{"given":"Vijaya","family":"Ramachandran","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Honghua","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"K. Booth","year":"1976","unstructured":"Booth, K., and Lueker, G. Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms.J. Comput. System Sci., vol. 13, 1976, pp. 335?379.","journal-title":"J. Comput. System Sci."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Courcoubetis, C., and Yannakakis, M. Verifying temporal properties of finite-state probabilistic programs.Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988, pp. 338?345.","DOI":"10.1109\/SFCS.1988.21950"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0304-3975(76)90086-4","volume":"2","author":"S. Even","year":"1976","unstructured":"Even, S., and Tarjan, R. Computing an st-numbering.Theoret. Comput. Sci., vol. 2, 1976, pp. 339?344.","journal-title":"Theoret. Comput. Sci."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/1008354.1008356","volume":"9","author":"L. M. Goldschlager","year":"1977","unstructured":"Goldschlager, L. M. The monotone and planar circuit value problems are log space complete forP.SIGACT News, vol. 9, 1977, pp. 25?29.","journal-title":"SIGACT News"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J. E. Hopcroft","year":"1974","unstructured":"Hopcroft, J. E., and Tarjan, R. E. Efficient planarity testing.J. Assoc. Comput. Mach., vol. 21, 1974, pp. 549?568.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR6","unstructured":"Kao, M., and Shannon, G. Local reorientation, global order, and planar topology.Proc. 18th Annual ACM Symp. on Theory of Computing, 1986, pp. 160?168."},{"key":"CR7","first-page":"215","volume-title":"Theory of Graphs: International Symposium","author":"A. Lempel","year":"1967","unstructured":"Lempel, A., Even, S., and Cederbaum, I. An algorithm for planarity testing of graphs.Theory of Graphs: International Symposium, Gordon and Breach, New York, 1967, pp. 215?232."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Pnueli, A., and Zuck, L. Probabilistic verification by tableaux.Proc. 1st Symp. on Logic in Computer Science, 1986, pp. 322?331.","DOI":"10.1007\/BF01843570"},{"key":"CR9","volume-title":"Technical Report TR 90-15","author":"V. Ramachandran","year":"1990","unstructured":"Ramachandran, V., and Reif, J. H. Planarity testing in parallel. Technical Report TR 90-15, Computer Science Department, University of Texas, Austin, TX, 1990; Preliminary version: An optimal parallel algorithm for graph planarity.Proc. 30th IEEE Symp. on Foundations of Computer Science, 1989, pp. 282?287."},{"key":"CR10","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R. E. Tarjan","year":"1983","unstructured":"Tarjan, R. E.Data Structures and Network Algorithms. SIAM, Philadelphia, PA, 1983."},{"issue":"no. 2","key":"CR11","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. E. Tarjan","year":"1972","unstructured":"Tarjan, R. E. Depth-first search and linear graph algorithms.SIAM J. Comput., vol. 1, no. 2, 1972, pp. 146?160.","journal-title":"SIAM J. Comput."},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"Vardi, M. Automatic verification of concurrent probabilistic finite state programs.Proc. 26th IEEE Symp. on Foundations of Computer Science, 1985, pp. 327?338.","DOI":"10.1109\/SFCS.1985.12"},{"key":"CR13","unstructured":"Yannakakis, M. Private communication. June 1990."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293266.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01293266\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01293266","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T09:35:49Z","timestamp":1586165749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01293266"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,5]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,5]]}},"alternative-id":["BF01293266"],"URL":"https:\/\/doi.org\/10.1007\/bf01293266","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,5]]}}}