{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:24Z","timestamp":1725490224046},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540745099"},{"type":"electronic","value":"9783540745105"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74510-5_18","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T15:11:35Z","timestamp":1187709095000},"page":"158-167","source":"Crossref","is-referenced-by-count":0,"title":["Resource Placement in Networks Using Chromatic Sets of Power Graphs"],"prefix":"10.1007","author":[{"given":"Navid","family":"Imani","sequence":"first","affiliation":[]},{"given":"Hamid","family":"Sarbazi-Azad","sequence":"additional","affiliation":[]},{"given":"Selim G.","family":"Akl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Agnarsson, G., Halld\u00f3rsson, M.M.: Coloring powers of planar graphs. ACM-SIAM Symp. Discrete Algorithms, ACM-SIAM, 654\u2013662 (2000)"},{"key":"18_CR2","first-page":"41","volume":"100","author":"G. Agnarsson","year":"2000","unstructured":"Agnarsson, G., Greenlaw, R., Halldorsson, M.M.: On powers of chordal graphs and their colorings. Congress Numerantium\u00a0100, 41\u201365 (2000)","journal-title":"Congress Numerantium"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1023\/B:SUPE.0000022572.95414.27","volume":"29","author":"B.F. Albdaiwi","year":"2004","unstructured":"Albdaiwi, B.F., Livingston, M.L.: Perfect Distance-d Placements in 2D Toroidal Networks. J. Supercomp.\u00a029, 45\u201357 (2004)","journal-title":"J. Supercomp."},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Alrabady, I., Mahmud, S.M., Chaudhary, V.: Placement of Resources in the Star Network. In: Proc. IEEE Int. Conf. on Algorithms and Architectures for Parallel Processing (1996)","DOI":"10.1109\/ICAPP.1996.562858"},{"key":"18_CR5","first-page":"327","volume-title":"Proc. IEEE International Parallel Processing Symposium","author":"M. Bae","year":"1996","unstructured":"Bae, M., Bose, B.: Resource placement in torus-based networks. In: Proc. IEEE International Parallel Processing Symposium, pp. 327\u2013331. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1109\/FTCS.1996.534613","volume-title":"Proc. IEEE Int\u2019l Symp. Fault-Tolerant Computing","author":"M. Bae","year":"1996","unstructured":"Bae, M., Bose, B.: Spare processor allocation for fault-tolerance in torus-based multicomputers. In: Proc. IEEE Int\u2019l Symp. Fault-Tolerant Computing, pp. 282\u2013291. IEEE Computer Society Press, Los Alamitos (1996)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1109\/12.628393","volume":"46","author":"M. Bae","year":"1997","unstructured":"Bae, M., Bose, B.: Resource placement in torus-based networks. IEEE Transaction on Computers\u00a046, 1083\u20131092 (1997)","journal-title":"IEEE Transaction on Computers"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0012-365X(95)00081-7","volume":"158","author":"A. Brandst\u00e4dt","year":"1996","unstructured":"Brandst\u00e4dt, A., Chepoi, V.D., Dragan, F.F.: Perfect elimination orderings of chordal powers of graphs. Discrete Mathematics\u00a0158, 273\u2013278 (1996)","journal-title":"Discrete Mathematics"},{"key":"18_CR9","unstructured":"Chen, H., Tzeng, N.: Fault-tolerant resource placement in hypercube computers. In: Proc. International Conference on Parallel Processing, pp. 515\u2013524 (1991)"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/12.250606","volume":"43","author":"H. Chen","year":"1994","unstructured":"Chen, H., Tzeng, N.: Efficient resource placement in hypercubes using multiple-adjacency codes. IEEE Transaction on Computers\u00a043, 23\u201333 (1994)","journal-title":"IEEE Transaction on Computers"},{"key":"18_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2016-7","volume-title":"SpherePacking, Lattices and Groups","author":"G.H. Conway","year":"1988","unstructured":"Conway, G.H., Sloane, N.J.A.: SpherePacking, Lattices and Groups. Springer, Heidelberg (1988)"},{"key":"18_CR12","first-page":"23","volume":"24B","author":"Dahlhaus","year":"1987","unstructured":"Dahlhaus, Duchet, E.P.: On strongly chordal graphs. Ars Combinatoria\u00a024B, 23\u201330 (1987)","journal-title":"Ars Combinatoria"},{"key":"18_CR13","first-page":"45","volume":"60","author":"B. Effantin","year":"2003","unstructured":"Effantin, B., Kheddouci, H.: The b-chromatic number of some power graphs. Discrete Mathematics and Theoretical Computer Science\u00a060, 45\u201354 (2003)","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"18_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511662058","volume-title":"The Petersen Graph","author":"D.A. Holton","year":"1993","unstructured":"Holton, D.A., Sheehan, J.: The Petersen Graph. Cambridge University Press, Cambridge, England (1993)"},{"key":"18_CR15","first-page":"22","volume-title":"Proc. IEEE Int\u2019l Symposium on Information Theory","author":"M. Jiang","year":"2004","unstructured":"Jiang, M., Bruck, C.J.: Optimal t-Interleaving on Tori. In: Proc. IEEE Int\u2019l Symposium on Information Theory, pp. 22\u201331. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/S0012-365X(99)00177-6","volume":"213","author":"H. Kheddouci","year":"2000","unstructured":"Kheddouci, H., Sacl\u00e9, J.F., wo\u017aniak, M.: Packing of two copies of a tree into its fourth power. Discrete Mathematics\u00a0213, 169\u2013178 (2000)","journal-title":"Discrete Mathematics"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Linial, N., Peleg, D., Rabinovich, Y., Saks, M.: Sphere packing and local majorities in graphs. In: Proc. 2nd ISTCS, pp. 141\u2013149 (1993)","DOI":"10.1109\/ISTCS.1993.253475"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Livingston, M., Stout, Q.: Distributing resources in hypercube computers. In: Proc. 3rd Conf. on Hypercube Concurrent Computers and Applications, pp. 222\u2013231 (1988)","DOI":"10.1145\/62297.62324"},{"key":"18_CR19","first-page":"431","volume-title":"Proc. IEEE Int\u2019l Parallel Processing Symposium","author":"B. AlBdaiwi AlMohammad","year":"1998","unstructured":"AlBdaiwi AlMohammad, B., Bose, B.: I\/O placements in 2D toroidal networks. In: Proc. IEEE Int\u2019l Parallel Processing Symposium, pp. 431\u2013438. IEEE Computer Society Press, Los Alamitos (1998)"},{"key":"18_CR20","unstructured":"AlBdaiwi AlMohammad, B., Bose, B.: On distance-d placements in 3D tori. In: Proc. Int\u2019l Conf. on Par. and Distr. Processing Tech. and Appl., pp. 1733\u20131739 (2001)"},{"key":"18_CR21","unstructured":"AlBdaiwi AlMohammad, B., Bose, B.: On resource placements in 3D tori. In: Proc. 5th World Multi-Conference on Systemics, Cybernetics and Informatics, pp. 96\u2013101 (2001)"},{"key":"18_CR22","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1109\/71.80142","volume":"1","author":"A.L.N. Reddy","year":"1990","unstructured":"Reddy, A.L.N., Banerjee, P.: Design, analysis, and simulation of I\/O architectures for hypercube multiprocessors. IEEE Trans. on Parallel and Distributed Systems\u00a01, 140\u2013151 (1990)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"18_CR23","volume-title":"Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica","author":"S. Skiena","year":"1990","unstructured":"Skiena, S.: Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Addison-Wesley, Reading. MA (1990)"},{"key":"18_CR24","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1109\/71.494628","volume":"7","author":"N. Tzeng","year":"1996","unstructured":"Tzeng, N., Feng, G.: Resource allocation in cube network systems based on the covering radius. IEEE Trans. on Parallel and Distributed Systems\u00a07, 328\u2013342 (1996)","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"18_CR25","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2000","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice-Hall, Englewood Cliffs (2000)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74510-5_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:21:49Z","timestamp":1619518909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74510-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540745099","9783540745105"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74510-5_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}