{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T09:12:29Z","timestamp":1776589949416,"version":"3.51.2"},"reference-count":9,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":7223,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1987,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We develop a linear time algorithm to determine if a given planar triangulated graph has a rectangular dual.<\/jats:p>","DOI":"10.1002\/net.3230170306","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T22:21:58Z","timestamp":1178922118000},"page":"307-317","source":"Crossref","is-referenced-by-count":54,"title":["A linear time algorithm to check for the existence of a rectangular dual of a planar triangulated graph"],"prefix":"10.1002","volume":"17","author":[{"given":"Jayaram","family":"Bhasker","sequence":"first","affiliation":[]},{"given":"Sartaj","family":"Sahni","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1974"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"J.BhaskerandS.Sahni A linear algorithm to find the rectangular dual of a planar triangulated graph. Technical report Computer Science Dept. University of Minnesota Minneapolis 1985.","DOI":"10.1109\/DAC.1986.1586076"},{"key":"e_1_2_1_4_2","unstructured":"G.BrebnerandD.Buchanan On compiling structural descriptions to floorplans. Proc. IEEE ICCAD Santa Clara Sept. (1983)6\u20137."},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"W. R.Heller G.Sorkin andK.Maling The planar package planner for system designers. Proc. 19th DAC Las Vegas June (1982)253\u2013260.","DOI":"10.1109\/DAC.1982.1585509"},{"key":"e_1_2_1_6_2","volume-title":"Fundamentals of Computer Algorithms","author":"Horowitz E.","year":"1978"},{"key":"e_1_2_1_7_2","volume-title":"Fundamentals of Data Structures in Pascal","author":"Horowitz E.","year":"1984"},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"K.KozminskiandE.Kinnen An algorithm for finding a rectangular dual of a planar graph for use in area planning for VLSI integrated circuits. Proc. 21st DAC Albuquerque June (1984)655\u2013656.","DOI":"10.1109\/DAC.1984.1585872"},{"key":"e_1_2_1_9_2","unstructured":"K.KozminskiandE.Kinnen Rectangular dual of planar graphs. Networks in press. (submitted for publication)."},{"key":"e_1_2_1_10_2","doi-asserted-by":"crossref","unstructured":"MalingK. S. H.Mueller andW. R.Heller On Finding Most Optimal Rectangular Package Plans Proc. 19th DAC Las Vegas June (1982)663\u2013670.","DOI":"10.1109\/DAC.1982.1585567"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230170306","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230170306","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T16:29:45Z","timestamp":1697905785000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230170306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["10.1002\/net.3230170306"],"URL":"https:\/\/doi.org\/10.1002\/net.3230170306","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}