{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T05:20:35Z","timestamp":1733548835326,"version":"3.30.1"},"reference-count":58,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1992,7,1]],"date-time":"1992-07-01T00:00:00Z","timestamp":709948800000},"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":7686,"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":[[1992,7]]},"DOI":"10.1016\/0166-218x(92)90128-w","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"119-146","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Stirling networks: a versatile combinatorial topology for multiprocessor systems"],"prefix":"10.1016","volume":"37-38","author":[{"given":"Sajal K.","family":"Das","sequence":"first","affiliation":[]},{"given":"Joydeep","family":"Ghosh","sequence":"additional","affiliation":[]},{"given":"Narsingh","family":"Deo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90128-W_BIB1","series-title":"Tech. Rept.","article-title":"On the fault-tolerance classification of interconnection networks","author":"Akers","year":"1988"},{"key":"10.1016\/0166-218X(92)90128-W_BIB2","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1109\/12.21148","article-title":"A group-theoretic model for symmetric interconnection networks","volume":"38","author":"Akers","year":"1989","journal-title":"IEEE Trans. Comput."},{"year":"1989","series-title":"The Design and Analysis of Parallel Algorithms","author":"Akl","key":"10.1016\/0166-218X(92)90128-W_BIB3"},{"key":"10.1016\/0166-218X(92)90128-W_BIB4","first-page":"590","article-title":"Fault diagnosis in a Boolean n-cube array of microprocessors","volume":"30","author":"Armstrong","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)90128-W_BIB5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0196-6774(80)90004-8","article-title":"A parallel algorithm for constructing minimum spanning trees","volume":"1","author":"Bentley","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(92)90128-W_BIB6","first-page":"257","article-title":"A tree machine for searching problems","author":"Bentley","year":"1979","journal-title":"Proceedings International Parallel Processing Conference"},{"key":"10.1016\/0166-218X(92)90128-W_BIB7","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/0743-7315(86)90008-0","article-title":"Strategies for interconnection networks: Some methods from graph theory","volume":"3","author":"Bermond","year":"1986","journal-title":"J. Parallel Distribut. Comput."},{"key":"10.1016\/0166-218X(92)90128-W_BIB8","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01788663","article-title":"Large fault-tolerant interconnection networks","volume":"5","author":"Bermond","year":"1989","journal-title":"Graphs Combin."},{"key":"10.1016\/0166-218X(92)90128-W_BIB9","first-page":"279","article-title":"DeBruija and Kautz networks: a competitor for the hypercube?","author":"Bermond","year":"1989","journal-title":"Proceedings of the First European Workshop on Hypercube and Distributed Computers"},{"key":"10.1016\/0166-218X(92)90128-W_BIB10","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1109\/TC.1984.1676437","article-title":"Generalized hypercube and hyperbus structures for a computer network","volume":"30","author":"Bhuyan","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)90128-W_BIB11","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1002\/jgt.3190080406","article-title":"Circulants and their connectivities","volume":"8","author":"Boesch","year":"1984","journal-title":"J. Graph Theory"},{"key":"10.1016\/0166-218X(92)90128-W_BIB12","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1109\/TIT.1987.1057290","article-title":"The forwarding index of communication networks","volume":"33","author":"Chung","year":"1987","journal-title":"IEEE Trans. Inform. Theory"},{"year":"1987","series-title":"A VLSI Architecture for Concurrent Data Structures","author":"Dally","key":"10.1016\/0166-218X(92)90128-W_BIB13"},{"key":"10.1016\/0166-218X(92)90128-W_BIB14","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TC.1987.1676939","article-title":"Deadlock-free message routing in multiprocessor interconnection networks","volume":"36","author":"Dally","year":"1987","journal-title":"IEEE Trans. Comput."},{"issue":"3\u20134","key":"10.1016\/0166-218X(92)90128-W_BIB15","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1080\/00207168808803644","article-title":"Wheel-augmented binary trees","volume":"24","author":"Das","year":"1988","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/0166-218X(92)90128-W_BIB16","first-page":"65","article-title":"Interconnection networks from combinatorial point of view","author":"Das","year":"1989","journal-title":"Proceedings 5th Annual Symposium on Massively Parallel Processing"},{"key":"10.1016\/0166-218X(92)90128-W_BIB17","first-page":"5","article-title":"Stirling graphs and their properties","volume":"54","author":"Das","year":"1986","journal-title":"Congr. Numer."},{"key":"10.1016\/0166-218X(92)90128-W_BIB18","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1080\/00150517.1987.12429698","article-title":"Rencontres graphs: A family of bipartite graphs","volume":"25","author":"Das","year":"1987","journal-title":"Fibonacci Quart."},{"key":"10.1016\/0166-218X(92)90128-W_BIB19","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1109\/31.1744","article-title":"Divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model","volume":"35","author":"Das","year":"1988","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/0166-218X(92)90128-W_BIB20","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0167-8191(90)90143-W","article-title":"Parallel graph algorithms for hypercube computers","volume":"13","author":"Das","year":"1990","journal-title":"Parallel Comput."},{"key":"10.1016\/0166-218X(92)90128-W_BIB21","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0167-8191(90)90041-7","article-title":"Two minimum spanning forest algorithms on fixed-size hypercube computers","volume":"15","author":"Das","year":"1990","journal-title":"Parallel Comput."},{"key":"10.1016\/0166-218X(92)90128-W_BIB22","unstructured":"S.K. Das and J. Ghosh, Massively parallel processing using Stirling networks, to appear."},{"year":"1974","series-title":"Graph Theory with Applications to Engineering and Computer Science","author":"Deo","key":"10.1016\/0166-218X(92)90128-W_BIB23"},{"key":"10.1016\/0166-218X(92)90128-W_BIB24","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1080\/00150517.1983.12429946","article-title":"Pascal graphs and their properties","volume":"21","author":"Deo","year":"1983","journal-title":"Fibonacci Quart."},{"key":"10.1016\/0166-218X(92)90128-W_BIB25","first-page":"144","article-title":"X-tree: A tree structured multiprocessor computer architecture","author":"Despain","year":"1978","journal-title":"Proceedings 5th Annual Symposium on Computer Architecture"},{"key":"10.1016\/0166-218X(92)90128-W_BIB26","article-title":"Fault-tolerant routings in double-loop networks","author":"Escudero","year":"1987","journal-title":"Ars Combin."},{"key":"10.1016\/0166-218X(92)90128-W_BIB27","first-page":"109","article-title":"Massively parallel architectures for AI: NETL, Thistle and Boltzmann Machines","author":"Fahlman","year":"1983","journal-title":"Proceedings National Conference on Artificial Intelligence"},{"key":"10.1016\/0166-218X(92)90128-W_BIB28","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/C-M.1981.220290","article-title":"A survey of interconnection networks","volume":"14","author":"Feng","year":"1981","journal-title":"IEEE Comput."},{"key":"10.1016\/0166-218X(92)90128-W_BIB29","doi-asserted-by":"crossref","first-page":"89","DOI":"10.2307\/2304500","article-title":"Binomial coefficient modulo a prime","volume":"54","author":"Fine","year":"1947","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0166-218X(92)90128-W_BIB30","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/24.24569","article-title":"A class of fault-tolerant multiprocessor networks","volume":"38","author":"Ghafoor","year":"1989","journal-title":"IEEE Trans. Reliability"},{"key":"10.1016\/0166-218X(92)90128-W_BIB31","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1109\/TC.1981.1675731","article-title":"Hypertree: A multiprocessor interconnection topology","volume":"30","author":"Goodman","year":"1981","journal-title":"IEEE Trans. Comput."},{"year":"1989","series-title":"Concrete Mathematics: A Foundation for Computer Science","author":"Graham","key":"10.1016\/0166-218X(92)90128-W_BIB32"},{"year":"1969","series-title":"Graph Theory","author":"Harary","key":"10.1016\/0166-218X(92)90128-W_BIB33"},{"key":"10.1016\/0166-218X(92)90128-W_BIB34","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1109\/TSE.1986.6312905","article-title":"NON-VON's performance on certain database bench-marks","volume":"12","author":"Hillyer","year":"1986","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0166-218X(92)90128-W_BIB35","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1109\/TC.1981.1675772","article-title":"The binary tree as an interconnection network: Applications to multiprocessor systems and VLSI","volume":"30","author":"Horowitz","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)90128-W_BIB36","doi-asserted-by":"crossref","first-page":"1450","DOI":"10.1109\/TC.1987.5009497","article-title":"Hypernet: A communication-efficient architecture for constructing massively parallel computers","volume":"36","author":"Hwang","year":"1987","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)90128-W_BIB37","series-title":"Computer Architecture: Concepts and Systems","first-page":"307","article-title":"Supercomputers and artificial intelligence machines","author":"Hwang","year":"1987"},{"key":"10.1016\/0166-218X(92)90128-W_BIB38","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0734-189X(86)80029-9","article-title":"On the application of massively parallel SIMD tree machines to certain intermediate-level vision tasks","volume":"36","author":"Ibrahim","year":"1988","journal-title":"Comput. Vision Graphics Image Process"},{"key":"10.1016\/0166-218X(92)90128-W_BIB39","first-page":"334","article-title":"Implicit representation of graphs","author":"Kannan","year":"1988","journal-title":"Proceedings ACM Symposium on Theoretical Computer Science"},{"key":"10.1016\/0166-218X(92)90128-W_BIB40","first-page":"267","article-title":"Virtual cut-through: A new computer communication switching technique","volume":"3","author":"Kermani","year":"1979","journal-title":"Comput. Networks"},{"year":"1973","series-title":"The Art of Computer Programming Vol. 1: Fundamental Algorithms","author":"Knuth","key":"10.1016\/0166-218X(92)90128-W_BIB41"},{"issue":"5\u20136","key":"10.1016\/0166-218X(92)90128-W_BIB42","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/0898-1221(87)90085-X","article-title":"Fault diameter of interconnection networks","volume":"13","author":"Krishnamoorthy","year":"1987","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0166-218X(92)90128-W_BIB43","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1109\/12.45208","article-title":"Incremental distance and diameter sequences of a graph: new measures of network performance","volume":"39","author":"Krishnamoorthy","year":"1990","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)90128-W_BIB44","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/12.45203","article-title":"Network resilience: A measure of network fault tolerance","volume":"39","author":"Najjar","year":"1990","journal-title":"IEEE Trans. Comput."},{"year":"1983","series-title":"Notes on Introductory Combinatorics","author":"Polya","key":"10.1016\/0166-218X(92)90128-W_BIB45"},{"key":"10.1016\/0166-218X(92)90128-W_BIB46","first-page":"467","article-title":"Fault-tolerant multiprocessor and VLSI-based system communication architectures","volume":"Vol. II","author":"Pradhan","year":"1986"},{"key":"10.1016\/0166-218X(92)90128-W_BIB47","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","article-title":"The cube-connected cycles: A versatile network for parallel computations","volume":"24","author":"Preparata","year":"1981","journal-title":"Comm. ACM"},{"year":"1987","series-title":"Multicomputer Networks: Message-Based Parallel Processing","author":"Reed","key":"10.1016\/0166-218X(92)90128-W_BIB48"},{"year":"1958","series-title":"An Introduction to Combinatorial Analysis","author":"Riordan","key":"10.1016\/0166-218X(92)90128-W_BIB49"},{"key":"10.1016\/0166-218X(92)90128-W_BIB50","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1109\/12.21149","article-title":"The De Bruijn multiprocessor network: A versatile parallel processing and sorting network for VLSI","volume":"38","author":"Samatham","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0166-218X(92)90128-W_BIB51","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0743-7315(89)90056-7","article-title":"A global measure of network connectivity","volume":"7","author":"Skillicorn","year":"1989","journal-title":"J. Parallel Distribut. Comput."},{"key":"10.1016\/0166-218X(92)90128-W_BIB52","series-title":"Ph.D. Thesis","article-title":"A complexity theory for VLSI","author":"Thompson","year":"1980"},{"key":"10.1016\/0166-218X(92)90128-W_BIB53","series-title":"Percepts and Information","article-title":"Algorithm-Structured Computer Arrays and Networks: Architechtures and Processes for Images","author":"Uhr","year":"1984"},{"year":"1987","series-title":"Multicomputer Architectures for Artificial Intelligence","author":"Uhr","key":"10.1016\/0166-218X(92)90128-W_BIB54"},{"year":"1984","series-title":"Computational Aspects of VLSI","author":"Ullman","key":"10.1016\/0166-218X(92)90128-W_BIB55"},{"year":"1984","series-title":"Tutorial: Interconnection Networks for Parallel and Distributed Processing","key":"10.1016\/0166-218X(92)90128-W_BIB56"},{"key":"10.1016\/0166-218X(92)90128-W_BIB57","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0020-0255(86)90013-7","article-title":"Finding fundamental cycles and bridges on a tree-structured parallel computer","volume":"40","author":"Yeh","year":"1986","journal-title":"Inform. Sci."},{"key":"10.1016\/0166-218X(92)90128-W_BIB58","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF02136031","article-title":"Graph algorithms on a tree-structured parallel computer","volume":"24","author":"Yeh","year":"1984","journal-title":"BIT"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290128W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290128W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T21:48:11Z","timestamp":1733521691000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290128W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":58,"alternative-id":["0166218X9290128W"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90128-w","relation":{},"ISSN":["0166-218X"],"issn-type":[{"type":"print","value":"0166-218X"}],"subject":[],"published":{"date-parts":[[1992,7]]}}}