{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:08:49Z","timestamp":1765886929651,"version":"3.32.0"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,7,1]],"date-time":"2006-07-01T00:00:00Z","timestamp":1151712000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2006,7]]},"DOI":"10.1007\/s11227-006-4598-4","type":"journal-article","created":{"date-parts":[[2006,7,6]],"date-time":"2006-07-06T15:05:00Z","timestamp":1152198300000},"page":"23-45","source":"Crossref","is-referenced-by-count":13,"title":["The Grid-Pyramid: A Generalized Pyramid Network"],"prefix":"10.1007","volume":"37","author":[{"given":"M. R.","family":"HoseinyFarahabady","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Sarbazi-Azad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4598_CR1","doi-asserted-by":"crossref","unstructured":"H. Sarbazi-Azad, M. Ould-khaoua, L. M. Mackenzie. Algorithmic construction of Hamiltonians in Pyramids, Information Processing Letters, 80:75\u201379, (2001).","DOI":"10.1016\/S0020-0190(01)00149-1"},{"key":"4598_CR2","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1109\/12.743415","volume":"48","author":"F. Cao","year":"1999","unstructured":"F. Cao, D. F. Hsu. Fault-tolerance properties of pyramid networks, IEEE Transactions on Computers, 48:88\u201393, (1999).","journal-title":"IEEE Transactions on Computers"},{"key":"4598_CR3","unstructured":"A. Dingle, H. Sudborough. Simulation of binary trees and x-trees on pyramid networks, In Proc. IEEE Symp. Parallel & Distributed Processing, 220\u2013229, (1992)."},{"key":"4598_CR4","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/0743-7315(90)90110-B","volume":"9","author":"T. H. Lai","year":"1990","unstructured":"T. H. Lai, W. White. Mapping pyramid algorithms into hypercube, Journal of Parallel and Distributed Computing, 9:42\u201354, (1990).","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"4598_CR5","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1137\/0216004","volume":"16","author":"R. Miller","year":"1987","unstructured":"R. Miller, Q. Stout. Data movement techniques for the pyramid computer, SIAM Journal of Computing, 16:38\u201360, (1987).","journal-title":"SIAM Journal of Computing"},{"key":"4598_CR6","unstructured":"S. G. Ziavras, M. A. Siddiqui. Pyramid mapping onto hypercube for computer vision, Concurrency: Practice & Experience, 471\u2013489, (1993)."},{"key":"4598_CR7","doi-asserted-by":"crossref","first-page":"1291","DOI":"10.1109\/71.250106","volume":"4","author":"Fu Jing-Jeng","year":"1993","unstructured":"Jing-Fu Jeng, et al. Image Shrinking and Expanding on a Pyramid, IEEE Transaction on parallel and distributed systems, 4:1291\u2013 1296, (1993).","journal-title":"IEEE Transaction on parallel and distributed systems"},{"key":"4598_CR8","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1006\/jpdc.1996.0097","volume":"36","author":"C. K","year":"1996","unstructured":"C. K. Y Ng, Embedding pyramids into 3D meshes, Journal of Parallel & Distributed Computing, 36:173\u2013184, (1996).","journal-title":"Journal of Parallel & Distributed Computing"},{"key":"4598_CR9","unstructured":"A. Dingle, H. Barada, Optimum embedding of end-around meshes into pyramid networks, In Proc. Int\u2019l Symp. Parallel Processing, 112\u2013118, (1991)."},{"key":"4598_CR10","unstructured":"F. T. Leighton, Introduction to parallel algorithms and architectures: arrays, trees, hypercubes, Morgan Kaufmann Publishers, New York, (1992)."},{"key":"4598_CR11","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0095-8956(71)90016-5","volume":"11","author":"JA Bondy","year":"1971","unstructured":"J. A Bondy, Pancyclic graphs I, J. Combin. Theory Ser. B, 11:80\u201384, (1971).","journal-title":"J. Combin. Theory Ser. B"},{"key":"4598_CR12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/jctb.1994.1010","volume":"60","author":"S. M. Zhang","year":"1994","unstructured":"S. M. Zhang, Pancyclism and bipancyclism of Hamiltonian graphs, J. Combin. Theory, 60:159\u2013168, (1994).","journal-title":"J. Combin. Theory"},{"key":"4598_CR13","doi-asserted-by":"crossref","unstructured":"S. S. Brandt, R. J. Faudree and W. Goddard, Weakly pancyclic graphs, J. Graph Theory, 27: 141\u2013176, (1998).","DOI":"10.1002\/(SICI)1097-0118(199803)27:3<141::AID-JGT3>3.0.CO;2-O"},{"key":"4598_CR14","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0095-8956(88)90058-5","volume":"45","author":"E. F. Schmeichal","year":"1988","unstructured":"E. F. Schmeichal and S. L. Hakimi, A cycle structure theorem or Hamiltonian graphs. Combin. Theory Ser. B, 45:99\u2013107, (1988).","journal-title":"Combin. Theory Ser. B"},{"key":"4598_CR15","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0012-365X(01)00333-8","volume":"251","author":"Mekkia Kouider","year":"2002","unstructured":"Mekkia Kouider and Antoni Marczyk, On pancyclism in hamiltonian graphs, Discrete Mathematics, 251:119\u2013127, (2002).","journal-title":"Discrete Mathematics"},{"key":"4598_CR16","unstructured":"J. A. Bondy, Pancyclic Graphs: Recent Results, Infinite and Finite sets (Colloq. Keszthely, 1973; Dedicated to P. Erdos on his 60th birthday), Colloq. Math. Soc., 181\u2013187, (1975)."},{"key":"4598_CR17","unstructured":"R. Haggkvist, R. J. Faudree, and R. H. Schelp, Pancyclic graphs-connected Ramsey number, Ars Combin. 11:37\u201349, (1991)."},{"key":"4598_CR18","unstructured":"Della Vecchia, G. C. Sanges, Recursively Scalable Networks for Message Passing Architectures, In Proc. Conf. Parallel Processing and Applications, 33\u201340, (1987)."},{"key":"4598_CR19","doi-asserted-by":"crossref","unstructured":"Sheng Fu, Hamiltonian-connectedness of the WK-Recursive network, 7th international Symposium on Parallel Architecture, Algorithms and Networks, 569\u2013574, (2004).","DOI":"10.1109\/ISPAN.2004.1300539"},{"key":"4598_CR20","unstructured":"J. Duato, S. Yalamanchili, L. M. Ni, Interconnection networks: An engineering approach, Morgan Kaufmann Publishers, New York, (2003)."},{"key":"4598_CR21","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1006\/jctb.1999.1916","volume":"7","author":"B. Bollob\u00e1s","year":"1999","unstructured":"B. Bollob\u00e1s, A. Thomason, Weakly Pancyclic Graphs, Journal of Combinatorial Theory, Ser. B, 7:121\u2013137, (1999).","journal-title":"Journal of Combinatorial Theory, Ser. B"},{"key":"4598_CR22","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0012-365X(96)00040-4","volume":"164","author":"H. J. Broersma","year":"1997","unstructured":"H. J. Broersma, A note on the minimum size of a vertex pancyclic graph, Discrete Mathematics 164:29-32, (1997).","journal-title":"Discrete Mathematics"},{"key":"4598_CR23","doi-asserted-by":"crossref","unstructured":"A. Dingle, H. Barada, Optimum embedding of end-around meshes into pyramid networks, In Proc. Int\u2019l Symp. Parallel Processing, 112\u2013118, (1991).","DOI":"10.1109\/IPPS.1991.153817"},{"key":"4598_CR24","unstructured":"M. R. Hoseiny, H. Sarbazi-Azad, On the Hamiltonian Connectedness of Pyramids, 4th IASTED International Conference on Communication Systems and Networks, (2005)."},{"key":"4598_CR25","unstructured":"Ruei-Yu Wu, Dyi-Rong Duh, Pancyclicity of Pyramid Networks. In International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA), 1523\u20131526, (2004)."},{"key":"4598_CR26","unstructured":". M.R. Hoseiny and H. Sarbazi-Azad, WK-Recursive Pyramid: A High Performance Network Topology, In Proceedings of 8th IEEE International Symposium on Parallel Architectures, Algorithms and Networks (IEEE-ISPAN\u201905), 312\u2013317, (2005)."}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-006-4598-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-006-4598-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-006-4598-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T20:07:41Z","timestamp":1736453261000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-006-4598-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,7]]}},"alternative-id":["4598"],"URL":"https:\/\/doi.org\/10.1007\/s11227-006-4598-4","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2006,7]]}}}