{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:39:34Z","timestamp":1761647974053},"reference-count":16,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2011,12]]},"abstract":"<jats:p> In this paper we formulate the Vertex Congestion Lemma leading to a new technique in computing the exact wirelength of an embedding. We compute the circular wirelength of generalized Petersen graphs by partitioning the vertices as well as the edges of cycles. Further we obtain the linear wirelength of circular ladders. Our algorithms produce optimal values in linear time. <\/jats:p>","DOI":"10.1142\/s0219265911003027","type":"journal-article","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T17:55:12Z","timestamp":1340819712000},"page":"319-335","source":"Crossref","is-referenced-by-count":6,"title":["CIRCULAR WIRELENGTH OF GENERALIZED PETERSEN GRAPHS"],"prefix":"10.1142","volume":"12","author":[{"given":"INDRA","family":"RAJASINGH","sequence":"first","affiliation":[{"name":"Department of Mathematics, Loyola College, Chennai 600 034, India"}]},{"given":"M.","family":"AROCKIARAJ","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Loyola College, Chennai 600 034, India"}]},{"given":"BHARATI","family":"RAJAN","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Loyola College, Chennai 600 034, India"}]},{"given":"PAUL","family":"MANUEL","sequence":"additional","affiliation":[{"name":"Department of Information Science, Kuwait University, Safat, Kuwait"}]}],"member":"219","published-online":{"date-parts":[[2012,6,28]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00256-0"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00162-4"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1007\/s000260050003"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(00)00227-2"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(98)00098-5"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1950-09407-5"},{"key":"rf8","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey M. R.","year":"1979"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199906)31:2<75::AID-JGT1>3.0.CO;2-S"},{"key":"rf11","volume-title":"Introduction to parallel algorithms and architecture: arrays, trees, hypercubes","author":"Leighton T. F.","year":"1992"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2008.09.013"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1109\/71.485505"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00161-4"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1002\/net.20027"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00224-9"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2000128"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3387-7"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265911003027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T17:08:52Z","timestamp":1565197732000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265911003027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":16,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2012,6,28]]},"published-print":{"date-parts":[[2011,12]]}},"alternative-id":["10.1142\/S0219265911003027"],"URL":"https:\/\/doi.org\/10.1142\/s0219265911003027","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}