{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T07:09:24Z","timestamp":1719299364909},"reference-count":13,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2000,3]]},"abstract":"<jats:p> In this paper we consider the problem of constructing planar orthogonal grid drawings (or more simply, layouts) of graphs, with the goal of minimizing the number of bends along the edges. We present optimal parallel algorithms that construct graph layouts with O(n) maximum edge length, O(n<jats:sup>2<\/jats:sup>) area, and at most 2n+4 bends (for biconnected graphs) and 2.4n+2 bends (for simply connected graphs). All three of these quality measures for the layouts are optimal in the worst case for biconnected graphs. The algorithm runs on a CREW PRAM in O( log n) time with n\/ log n processors, thus achieving optimal time and processor utilization. Applications include VLSI layout, graph drawing, and wireless communication. <\/jats:p>","DOI":"10.1142\/s0129626400000147","type":"journal-article","created":{"date-parts":[[2003,4,22]],"date-time":"2003-04-22T07:43:44Z","timestamp":1050997424000},"page":"141-150","source":"Crossref","is-referenced-by-count":1,"title":["A Parallel Algorithm for Planar Orthogonal Grid Drawings"],"prefix":"10.1142","volume":"10","author":[{"given":"ROBERTO","family":"TAMASSIA","sequence":"first","affiliation":[{"name":"Center for Geometric Computing, Department of Computer Science, Brown University, Providence, R.I. 02912\u20131910, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"IOANNIS G.","family":"TOLLIS","sequence":"additional","affiliation":[{"name":"Computer Science Department, University of Texas at Dallas, Richardson, TX 75083, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JEFFREY SCOTT","family":"VITTER","sequence":"additional","affiliation":[{"name":"Center for Geometric Computing, Department of Computer Science, Duke University, Durham, N.C. 27708\u20130129, U.S.A."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"p_1","first-page":"186","author":"Aggarwal A.","year":"1985","journal-title":"Proc."},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1137\/0217009"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90019-X"},{"key":"p_7","first-page":"235","volume":"4","journal-title":"Geom. Theory Appl."},{"key":"p_8","first-page":"147","volume":"2","author":"Dolev D.","journal-title":"Advances in Computing Research"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90032-4"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140202"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1137\/0216030"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1109\/31.34669"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1109\/SPDP.1991.218215"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90059-Q"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1137\/0220045"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1137\/0214027"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626400000147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T14:43:04Z","timestamp":1565102584000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626400000147"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,3]]},"references-count":13,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2000,3]]}},"alternative-id":["10.1142\/S0129626400000147"],"URL":"https:\/\/doi.org\/10.1142\/s0129626400000147","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,3]]}}}