{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:07Z","timestamp":1725483727614},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678236"},{"type":"electronic","value":"9783540449294"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44929-9_13","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:20:53Z","timestamp":1178371253000},"page":"152-168","source":"Crossref","is-referenced-by-count":0,"title":["Trade-Offs between Density and Robustness in Random Interconnection Graphs"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Flajolet","sequence":"first","affiliation":[]},{"given":"Kostas","family":"Hatzis","sequence":"additional","affiliation":[]},{"given":"Sotiris","family":"Nikoletseas","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Spirakis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"13_CR1","unstructured":"N. Alon and J. Spencer, \u201cThe Probabilistic Method\u201d, John Wiley & Sons, 1992."},{"key":"13_CR2","unstructured":"D. Bauer, F. Boesch, C. Suffel and R. Tindell, \u201cConnectivity extremal problems and the design of reliable probabilistic networks\u201d, The Theory of Applications of Graphs, John Wiley and Sons, 1981."},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/net.3230110106","volume":"11","author":"F. T. Boesch","year":"1981","unstructured":"F. T. Boesch, F. Harary and J. A. Cabell, \u201cGraphs and models of communication networks vulnerability: connectivity and persistence\u201d, Networks, vol. 11, pp. 57\u201363, 1981.","journal-title":"Networks"},{"key":"13_CR4","unstructured":"B. Bolloba\u015b, \u201cRandom Graphs\u201d, Academic Press, 1985."},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1137\/S0097539795290805","volume":"28","author":"A. Broder","year":"1994","unstructured":"A. Broder, A. Frieze, S. Suen and E. Upfal, \u201cOptimal construction of edge-disjoint paths in random graphs\u201d, SIAM Journal on Computing 28, 541\u2013574. Also in the Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 603\u2013612, 1994.","journal-title":"SIAM Journal on Computing"},{"key":"13_CR6","unstructured":"F. Chyzak, Ph. Flajolet and B. Salvy, \u201cStudies in automatic Combinatorics, Volume II\u201d, INRIA 1998. Available at URL http:\/\/pauillac.inria.fr\/algo\/libraries\/autocomb\/autocomb.html"},{"key":"13_CR7","first-page":"17","volume":"5","author":"P. Erd\u00f6s","year":"1960","unstructured":"P. Erd\u00f6s and A. Renyi, \u201cOn the evolution of random graphs\u201d, Magyar Tud. Akad. Math. Kut. Int. Kozl. 5, pp. 17\u201361, 1960.","journal-title":"Magyar Tud. Akad. Math. Kut. Int. Kozl."},{"key":"13_CR8","unstructured":"Ph. Flajolet and R. Sedgewick, \u201cAn Introduction to the Analysis of Algorithms\u201d, Addison Wesley, 1996."},{"key":"13_CR9","unstructured":"Ph. Flajolet and R. Sedgewick, \u201cAnalytic Combinatorics\u201d, book in preparation 1999 Individual chapters are available as INRIA Research Reports 1888, 2026, 2376, 2956, 3162)."},{"key":"13_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-57273-2_56","volume-title":"Proceedings of the 1st European Symposium on Algorithms (ESA)","author":"J. Hromkovic","year":"1993","unstructured":"J. Hromkovic, R. Klasing, E. Stoehr and H. Wagener, \u201cGossiping in Vertex-Disjoint Paths Mode in d-dimensional Grids and Planar Graphs\u201d, Proceedings of the 1st European Symposium on Algorithms (ESA), pp. 200\u2013211, LNCS vol. 726, 1993."},{"key":"13_CR11","first-page":"232","volume":"4","author":"S. Janson","year":"1993","unstructured":"S. Janson, D. Knuth, T. Luczak and B. Pittel, \u201cThe Birth of the Giant Component\u201d, Random Structures and Algorithms, vol. 4, pp. 232\u2013355, 1993.","journal-title":"Random Structures and Algorithms"},{"key":"13_CR12","unstructured":"Z. Kedem, K. Palem, P. Spirakis and M. Yung, \u201cFaulty Random Graphs: reliable effcient-on-the-average network computing\u201d, Computer Technology Institute (CTI) Technical Report, 1993."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"S. Nikoletseas, K. Palem, P. Spirakis, M. Young, \u201cShort Vertex Disjoint Paths and Multiconnectivity in Random Graphs: Reliable Network Computing\u201d, 21st International Colloquium on Automata, Languages and Programming (ICALP), Jerusalem, pp. 508\u2013515, 1994.","DOI":"10.1007\/3-540-58201-0_94"},{"key":"13_CR14","unstructured":"J. Spencer, \u201cTen Lectures on the Probabilistic Method\u201d, SIAM, 1987."}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44929-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T18:40:51Z","timestamp":1556390451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44929-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678236","9783540449294"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44929-9_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}