{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:27:23Z","timestamp":1742383643041},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0024505","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T02:30:56Z","timestamp":1132367456000},"page":"288-302","source":"Crossref","is-referenced-by-count":7,"title":["Large networks with small diameter"],"prefix":"10.1007","author":[{"given":"Michael","family":"Sampels","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"issue":"11","key":"24_CR1","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1109\/26.111428","volume":"39","author":"B. W. Arden","year":"1991","unstructured":"Bruce W. Arden and K. Wendy Tang. IEEE Transactions on Communications, 39(11):1533\u20131537, November 1991.","journal-title":"IEEE Transactions on Communications"},{"key":"24_CR2","first-page":"23","volume":"13","author":"J. C. Bermond","year":"1982","unstructured":"J. C. Bermond, C. Delorme, and G. Farhi. Large graphs with given degree and diameter III. Annals of Discrete Mathematics, 13:23\u201332, 1982.","journal-title":"Annals of Discrete Mathematics"},{"key":"24_CR3","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1016\/0095-8956(84)90012-1","volume":"36","author":"J. C. Bermond","year":"1984","unstructured":"J. C. Bermond, C. Delorme, and G. Farhi. Large graphs with given degree and diameter. II. iJournal of Combinatorial Theory, Series B, 36:32\u201348, 1984.","journal-title":"iJournal of Combinatorial Theory, Series B"},{"key":"24_CR4","first-page":"3","volume":"3","author":"J. Bermond","year":"1981","unstructured":"Jean-Claude Bermond and B\u00e9la Bollob\u00e1s. The diameter of graphs\u2013A survey. Congressus Numerantium, 3:3\u201327, 1981.","journal-title":"Congressus Numerantium"},{"key":"24_CR5","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1016\/0743-7315(86)90008-0","volume":"3","author":"J. Bermond","year":"1986","unstructured":"Jean-Claude Bermond, Charles Delorme, and J.-J. Quisquater. Strategies for interconnection networks, some results from graph theory. Journal of Parallel and Distributed Computing, 3:433\u2013449, 1986.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"24_CR6","unstructured":"Norman Biggs. Algebraic Graph Theory. Cambridge University Press, 2nd edition, 1993."},{"issue":"8","key":"24_CR7","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1109\/TC.1986.1676827","volume":"C-35","author":"S. H. Bokhari","year":"1986","unstructured":"Shahid H. Bokhari and A. D. Raza. Reducing the diameters of computer networks. IEEE Transactions on Computers, C-35(8):757\u2013761, August 1986.","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"24_CR8","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1109\/12.123397","volume":"41","author":"L. Campbell","year":"1992","unstructured":"Lowell Campbell et al. Small diameter symmetric networks from linear groups. IEEE Transactions on Computers, 41(2):218\u2013220, 1992.","journal-title":"IEEE Transactions on Computers"},{"key":"24_CR9","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0167-8191(93)90041-I","volume":"19","author":"A. G. Chalmers","year":"1993","unstructured":"Alan G. Chalmers and Steve Gregory. Constructing minimum path configurations for multiprocessor systems. Parallel Computing, 19:343\u2013355, 1993.","journal-title":"Parallel Computing"},{"key":"24_CR10","first-page":"295","volume":"60","author":"F. R. K. Chung","year":"1987","unstructured":"Fan R. K. Chung. Diameters of graphs: Old and new results. Congressus Numerantium, 60:295\u2013317, 1987.","journal-title":"Congressus Numerantium"},{"key":"24_CR11","first-page":"221","volume-title":"Graph Theory, Combinatorics and Algorithms, volume 1","author":"F. Comellas","year":"1995","unstructured":"F. Comellas and J. G\u00f3mez. New large graphs with given degree and diameter. In Y. Alavi and A. Schwenk, editors, Graph Theory, Combinatorics and Algorithms, volume 1, pages 221\u2013233, New York, 1995. John Wiley & Sons, Inc."},{"key":"24_CR12","unstructured":"Francesc Comellas. comellas@mat.upc.es."},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"Robert Cypher, Friedhelm Meyer auf der Heide; Christian Scheideler, and Berthold V\u00f6cking. Universal algorithms for store-and-forward and wormhole routing. In Proceedings of the 26th ACM-STOC, pages 356\u2013365, 1996.","DOI":"10.1145\/237814.237982"},{"key":"24_CR14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(92)90130-3","volume":"37\/38","author":"C. Delorme","year":"1992","unstructured":"C. Delorme. Examples of products giving large graphs with given degree and diameter. Discrete Applied Mathematics, 37\/38:157\u2013167, 1992.","journal-title":"Discrete Applied Mathematics"},{"key":"24_CR15","unstructured":"Charles Delorme.cd@Iri.fr."},{"issue":"9","key":"24_CR16","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1109\/TC.1984.1676504","volume":"C-33","author":"C. Delorme","year":"1984","unstructured":"Charles Delorme and G. Farhi. Large graphs with given degree and diameter \u2014 part I. IEEE Transactions on Computers, C-33(9):857\u2013860, September 1984.","journal-title":"IEEE Transactions on Computers"},{"key":"24_CR17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1002\/net.3230240702","volume":"24","author":"M. J. Dinneen","year":"1994","unstructured":"Michael J. Dinneen and Paul R. Hafner. New results for the degree\/diameter problem. Networks, 24:359\u2013367, 1994.","journal-title":"Networks"},{"key":"24_CR18","first-page":"175","volume-title":"Graph Theory, Combinatorics, Algorithms and Applications","author":"G. Exoo","year":"1991","unstructured":"Geoffrey Exoo. Applying optimization algorithms to Ramsey problems. In Yousef Alavi, editor, Graph Theory, Combinatorics, Algorithms and Applications, pages 175\u2013179. John Wiley & Sons, Inc, New York, 1991."},{"key":"24_CR19","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/BF01386025","volume":"3","author":"H. Felsch","year":"1961","unstructured":"H. Felsch. Programmierung der Restklassenabz\u00e4hlung einer Gruppe nach Untergruppen. Numerische Mathematik, 3:250\u2013256, 1961.","journal-title":"Numerische Mathematik"},{"key":"24_CR20","unstructured":"P. Hafner. Large Cayley graphs and digraphs for the degree\/diameter problem: an update. (in preparation), 1997."},{"key":"24_CR21","unstructured":"Berthold Hagmann. Optimierungstechniken zum Entwurf g\u00fcnstiger Netztopologien mittels Cayley-Graphen. Diploma thesis, Universit\u00e4t Oldenburg, 1997."},{"key":"24_CR22","volume-title":"Adaptation in Natural and Artificial Systems","author":"J. H. Holland","year":"1975","unstructured":"J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, 1975."},{"key":"24_CR23","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1016\/0167-8191(93)90054-O","volume":"19","author":"S. Lakshmivarahan","year":"1993","unstructured":"S. Lakshmivarahan, Jung-Sing Jwo, and S. K. Dhall. Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey. Parallel Computing, 19:361\u2013407, 1993.","journal-title":"Parallel Computing"},{"key":"24_CR24","unstructured":"John Leech. Coset enumeration. In Michael D. Atkinson, editor, Computational Group Theory, pages 3\u201318. Academic Press, 1984."},{"key":"24_CR25","volume-title":"Parallel Algorithms and Architectures","author":"F. T. Leighton","year":"1992","unstructured":"F. Thomson Leighton. Parallel Algorithms and Architectures. Morgan Kaufmann Publishers, San Mateo, California, 1992."},{"issue":"8","key":"24_CR26","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1109\/TC.1982.1676084","volume":"C-31","author":"G. Memmi","year":"1982","unstructured":"Gerard Memmi and Yves Raillard. Some new results about the (d, k) graph problem. IEEE Transactions on Computers, C-31(8):784\u2013791, August 1982.","journal-title":"IEEE Transactions on Computers"},{"key":"24_CR27","doi-asserted-by":"crossref","unstructured":"Friedhelm Meyer auf der Heide and Berthold Vocking. A packet routing protocol for arbitrary networks. In E. W. Mayr and C. Puech, editors,Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS '95), LNCS 900, pages 291\u2013302, 1995.","DOI":"10.1007\/3-540-59042-0_81"},{"key":"24_CR28","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/BF01304186","volume":"68","author":"G. Sabidussi","year":"1964","unstructured":"Gert Sabidussi. Vertex-transitive graphs. Monatshefte f\u00fcr Mathematik, 68:426\u2013438, 1964.","journal-title":"Monatshefte f\u00fcr Mathematik"},{"key":"24_CR29","unstructured":"Michael Sampels. Algebraic constructions of efficient systolic architectures. In Proceedings of the 2nd International Conference on Massively Parallel Computing Systems (MPCS '96), pages 15\u201322. IEEE Computer Society Press, 1996."},{"key":"24_CR30","first-page":"67","volume-title":"Cayley graphs as interconnection networks: A case study","author":"M. Sampels","year":"1996","unstructured":"Michael Sampels. Cayley graphs as interconnection networks: A case study. In Proceedings of the 7th International Workshop on Parallel Processing by Cellular Automata and Arrays (PARCELLA '96), pages 67\u201376, Berlin, 1996. Akademie-Verlag."},{"key":"24_CR31","unstructured":"Michael Sampels. Massively parallel architectures and systolic communication. In Proceedings of the 5th Euromicro Workshop on Parallel and Distributed Processing (PDP '97), pages 322\u2013329. IEEE Computer Society Press, 1997."},{"key":"24_CR32","unstructured":"Michael Sampels. Representation of vertex-symmetric interconnection networks. In Proceedings of the 2nd International Conference on Parallel Processing & Applied Mathematics. (to appear), 1997."},{"key":"24_CR33","unstructured":"Michael Sampels and Stefan Sch\u00f6f. Massively parallel architectures for parallel discrete event. simulation. In Proceedings of the 8th European Simulation Symposium (ESS '96), volume 2, pages 374\u2013378. SCS, 1996."},{"key":"24_CR34","doi-asserted-by":"crossref","unstructured":"Christian Scheideler and Berthold V\u00f6cking. Universal continuous routing strategies. In Proceedings of the 8th ACM-SPAA, pages 142\u2013151. ACM, 1996.","DOI":"10.1145\/237502.237519"},{"key":"24_CR35","volume-title":"GAP \u2014 groups, algorithms and programming","author":"M. Sch\u00f6nert","year":"1995","unstructured":"Martin Sch\u00f6nert. GAP \u2014 groups, algorithms and programming. Lehrstuhl D f\u00fcr Mathematik, RWTH Aachen, 1995."},{"key":"24_CR36","doi-asserted-by":"crossref","first-page":"1214","DOI":"10.1109\/T-C.1970.222861","volume":"C-19","author":"R. M. Storwick","year":"1970","unstructured":"Robert M. Storwick. Improved construction techniques for (d, k) graphs. IEEE Transactions on Computers, C-19:1214\u20131216, December 1970.","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"24_CR37","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1017\/S0013091500008221","volume":"5","author":"J. A. Todd","year":"1936","unstructured":"J. A. Todd and H. S. M. Coxeter. A practical method for enumerating cosecs of a finite abstract group. Proceeding of the Edinburgh Mathematical Society, 5(2):26\u201334, 1936.","journal-title":"Proceeding of the Edinburgh Mathematical Society"},{"key":"24_CR38","unstructured":"Lutz Twele. Effiziente Implementierung des Todd-Coxeter Algorithmus im Hinblick auf Grad\/Durchmesser-Optimierung von knotentransitiven Graphen. Diploma thesis, Universit\u00e4t Oldenburg, 1997."},{"key":"24_CR39","unstructured":"Otto Wohlmuth. A new dense group graph discovered by an evolutionary approach. In Paralleles und Verteiltes Rechnen, Beitr\u00e4ge zum 4. Workshop \u00fcber wissenschaftliches Rechnen. Shaker Verlag. 1996."},{"key":"24_CR40","doi-asserted-by":"crossref","unstructured":"H. P. Yap. Some topics in graph theory. London Mathematical Society Lecture Note Series 108. Cambridge University Press, 1986.","DOI":"10.1017\/CBO9780511662065"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T21:35:43Z","timestamp":1586554543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/bfb0024505","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}