{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T10:04:00Z","timestamp":1767866640093,"version":"3.49.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7990,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1016\/0304-3975(91)90020-3","type":"journal-article","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T19:37:51Z","timestamp":1141241871000},"page":"243-266","source":"Crossref","is-referenced-by-count":76,"title":["Planar orientations with low out-degree and compaction of adjacency matrices"],"prefix":"10.1016","volume":"86","author":[{"given":"Marek","family":"Chrobak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Eppstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(91)90020-3_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(91)90020-3_BIB2","first-page":"303","article-title":"On approximating a vertex cover for planar graphs","author":"Bar-Yehuda","year":"1982","journal-title":"Proc. 14th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90020-3_BIB3","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"The parallel evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(91)90020-3_BIB4","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1137\/0211055","article-title":"An approximation algorithm for the maximum independent set problem on planar graphs","author":"Chiba","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90020-3_BIB5","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","article-title":"Arboricity and subgraph listing algorithms","volume":"14","author":"Chiba","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90020-3_BIB6","unstructured":"M. Chrobak and J. Naor, An efficient parallel algorithm for computing a large independent set in planar graphs, Submitted for publication."},{"key":"10.1016\/0304-3975(91)90020-3_BIB7","unstructured":"K. Diks, Parallel recognition of outer-planar graphs, Submitted for publication."},{"key":"10.1016\/0304-3975(91)90020-3_BIB8","unstructured":"D. Eppstein, Parallel recognition of series-parallel graphs, Submitted for publication."},{"key":"10.1016\/0304-3975(91)90020-3_BIB9","first-page":"215","article-title":"Outerplanar graphs and weak duals","volume":"38","author":"Fleishner","year":"1974","journal-title":"J. Indian Math. Soc."},{"key":"10.1016\/0304-3975(91)90020-3_BIB10","first-page":"315","article-title":"Parallel symmetry breaking in sparse graphs","author":"Goldberg","year":"1987","journal-title":"Proc. 19th Ann. Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90020-3_BIB11","unstructured":"T. Hagerup, M. Chrobak and K. Diks, Optimal parallel 5-coloring of planar graphs, SIAM J. Comput., to appear."},{"key":"10.1016\/0304-3975(91)90020-3_BIB12","series-title":"Graph Theory","author":"Harary","year":"1972"},{"key":"10.1016\/0304-3975(91)90020-3_BIB13","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0890-5401(87)90061-7","article-title":"Parallel recognition and decomposition of two terminal series parallel graphs","volume":"75","author":"He","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(91)90020-3_BIB14","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","article-title":"Efficient planarity testing","volume":"21","author":"Hopcroft","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(91)90020-3_BIB15","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0207033","article-title":"Finding a minimum circuit in a graph","volume":"7","author":"Itai","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90020-3_BIB16","first-page":"334","article-title":"Implicit representations of graphs","author":"Kannan","year":"1988","journal-title":"Proc. 20th Ann. Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90020-3_BIB17","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","article-title":"Parallel prefix computation","volume":"27","author":"Ladner","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(91)90020-3_BIB18","doi-asserted-by":"crossref","first-page":"555","DOI":"10.4153\/CJM-1960-049-6","article-title":"On orientations, connectivity and odd-vertex pairings in finite graphs","volume":"12","author":"Nash-Williams","year":"1960","journal-title":"Can. J. Math."},{"key":"10.1016\/0304-3975(91)90020-3_BIB19","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","article-title":"Edge-disjoint spanning trees of finite graphs","volume":"36","author":"Nash-Williams","year":"1961","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0304-3975(91)90020-3_BIB20","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(81)90041-7","article-title":"The clique problem for planar graphs","volume":"13","author":"Papadimitriou","year":"1981","journal-title":"Inform. Process Lett."},{"key":"10.1016\/0304-3975(91)90020-3_BIB21","unstructured":"W. Schnyder, Embedding planar graphs on the grids, a manuscript."},{"key":"10.1016\/0304-3975(91)90020-3_BIB22","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0214061","article-title":"An efficient parallel biconnectivity algorithm","volume":"14","author":"Tarjan","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(91)90020-3_BIB23","first-page":"1","article-title":"The recognition of series parallel digraphs","author":"Valdes","year":"1979","journal-title":"Proc. 11th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(91)90020-3_BIB24","unstructured":"S. Vishwanathan and M.A. Sridhar, Some results on graph coloring in paralle, manuscript."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591900203?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397591900203?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T05:51:00Z","timestamp":1547790660000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397591900203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["0304397591900203"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(91)90020-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}