{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T11:47:51Z","timestamp":1648900071312},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5617,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0166-218x(97)00105-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"79-96","source":"Crossref","is-referenced-by-count":9,"title":["Spanning subgraphs with applications to communication on a subclass of the Cayley-graph-based networks"],"prefix":"10.1016","volume":"83","author":[{"given":"Paraskevi","family":"Fragopoulou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Selim G.","family":"Akl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00105-4_BIB1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0743-7315(91)90033-6","article-title":"Optimal communication algorithms for hypercubes","volume":"11","author":"Bertsekas","year":"1991","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0166-218X(97)00105-4_BIB2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1006\/jpdc.1995.1006","article-title":"Optimal communication algorithms on star graphs using spanning tree constructions","volume":"24","author":"Fragopoulou","year":"1995","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0166-218X(97)00105-4_BIB3","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/12.485370","article-title":"Edge-disjoint spanning trees on the star network with applications to fault tolerance","volume":"45","author":"Fragopoulou","year":"1996","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(97)00105-4_BIB4","doi-asserted-by":"crossref","first-page":"991","DOI":"10.1016\/0167-8191(96)00029-4","article-title":"Efficient algorithms for global data communications on the multidimensional torus network","volume":"22","author":"Fragopoulou","year":"1996","journal-title":"Parallel Comput."},{"key":"10.1016\/S0166-218X(97)00105-4_BIB5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1006\/jpdc.1996.0012","article-title":"Optimal communication primitives on the generalized hypercube network","volume":"32","author":"Fragopoulou","year":"1996","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0166-218X(97)00105-4_BIB6","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","article-title":"Methods and problems of communication in usual networks","volume":"53","author":"Fraigniaud","year":"1994","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00105-4_BIB7","series-title":"Algebra for Computer Science","author":"Garding","year":"1988"},{"key":"10.1016\/S0166-218X(97)00105-4_BIB8","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1002\/net.3230180406","article-title":"A survey of gossiping and broadcasting in communication networks","volume":"18","author":"Hedetniemi","year":"1988","journal-title":"Networks"},{"key":"10.1016\/S0166-218X(97)00105-4_BIB9","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","article-title":"Optimum broadcasting and personalized communication in hypercubes","volume":"38","author":"Johnson","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0166-218X(97)00105-4_BIB10","series-title":"The Art of Computer Programming","author":"Knuth","year":"1973"},{"key":"10.1016\/S0166-218X(97)00105-4_BIB11","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0167-8191(93)90054-O","article-title":"Symmetry in interconnection networks based on Cayley graphs of permutation groups: a survey","volume":"19","author":"Lakshmivarahan","year":"1993","journal-title":"Parallel Comput."},{"key":"10.1016\/S0166-218X(97)00105-4_BIB12","series-title":"Discrete Mathematics","author":"Ross","year":"1985"},{"key":"10.1016\/S0166-218X(97)00105-4_BIB13","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1016\/0167-8191(92)90068-I","article-title":"Communication algorithms for isotropic tasks in hypercubes and wraparound meshes","volume":"18","author":"Varvarigos","year":"1992","journal-title":"Parallel Comput"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001054?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97001054?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:51:25Z","timestamp":1556131885000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97001054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0166218X97001054"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00105-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}