{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T07:55:04Z","timestamp":1726041304320},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811389610"},{"type":"electronic","value":"9789811389627"}],"license":[{"start":{"date-parts":[[2019,8,15]],"date-time":"2019-08-15T00:00:00Z","timestamp":1565827200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-981-13-8962-7_6","type":"book-chapter","created":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T07:02:58Z","timestamp":1565766178000},"page":"69-77","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Generation of Simple, Connected, Non-isomorphic Random Graphs"],"prefix":"10.1007","author":[{"given":"Maumita","family":"Chakraborty","sequence":"first","affiliation":[]},{"given":"Sumon","family":"Chowdhury","sequence":"additional","affiliation":[]},{"given":"Rajat Kumar","family":"Pal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,15]]},"reference":[{"key":"6_CR1","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data Structures and Algorithms. First Edition. Pearson (1983)"},{"issue":"4","key":"6_CR2","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1007\/s00453-009-9340-1","volume":"58","author":"M Bayati","year":"2010","unstructured":"Bayati, M., Kim, J.H., Saberi, A.: A sequential algorithm for generating random graphs. Algorithmica (Springer) 58(4), 860\u2013910 (2010)","journal-title":"Algorithmica (Springer)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Bhuiyan, H., Khan, M., Marathe, M.: A parallel algorithm for generating a random graph with a prescribed degree sequence. In: arXiv preprint: 1708.07290 (2017)","DOI":"10.1109\/BigData.2017.8258316"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Cordeiro, D., Mounie, G., Perarnau, S., Trystram, D., Vincent, J.M., Wagner, F.: Random graph generation for scheduling simulations. In: Proceedings of Third International Conference on Simulation Tools and Techniques (SIMUTools\u201910), Article No. 60 (2010)","DOI":"10.4108\/ICST.SIMUTOOLS2010.8667"},{"key":"6_CR5","volume-title":"Graph Theory with Applications to Engineering and Computer Science","author":"N Deo","year":"2003","unstructured":"Deo, N.: Graph Theory with Applications to Engineering and Computer Science. Prentice Hall of India Pvt. Ltd., New Delhi (2003)"},{"key":"6_CR6","first-page":"17","volume":"5","author":"P Erdos","year":"1960","unstructured":"Erdos, P., Renyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5, 17\u201361 (1960)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"6_CR7","unstructured":"Horn, M.V., Richter, A., Lopez, D.: A random graph generator. In: Proceedings of 36th Annual Midwest Instruction and Computing Symposium, Duluth, Minnesota (2003)"},{"key":"6_CR8","volume-title":"Fundamentals of Data Structures in C","author":"E Horowitz","year":"2008","unstructured":"Horowitz, E., Sahni, S., Anderson, S.: Fundamentals of Data Structures in C, 2nd edn. Universities Press Pvt. Ltd., Hyderabad, India (2008)","edition":"2"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Nobari, S., Lu, X., Karras, P., Bressan, S.: Fast random graph generation. In: Proceedings of the 14th International Conference on Extending Database Technology, Uppsala, Sweden, pp. 331\u2013342 (2011). \n                    https:\/\/doi.org\/10.1145\/1951365.1951406","DOI":"10.1145\/1951365.1951406"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/11533719_4","volume-title":"Lecture Notes in Computer Science","author":"Shiquan Wu","year":"2005","unstructured":"Viger, F., Latapy, M.: Efficient and simple generation of random simple connected graphs with prescribed degree sequence. In: Computing and Combinatorics, COCOON 2005. Lecture Notes in Computer Science (Springer, Berlin, Heidelberg) 3595, pp. 440\u2013449 (2005). \n                    https:\/\/doi.org\/10.1007\/11533719_4"},{"issue":"1","key":"6_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1093\/comnet\/cnv013","volume":"4","author":"F Viger","year":"2016","unstructured":"Viger, F., Latapy, M.: Efficient and simple generation of random simple connected graphs with prescribed degree sequence. J. Complex Netw. 4(1), 15\u201337 (2016)","journal-title":"J. Complex Netw."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1017\/nws.2014.7","volume":"2","author":"C Wang","year":"2014","unstructured":"Wang, C., Lizardo, O., Hachen, D.: Algorithms for generating large-scale clustered random graphs. Network Sci. 2, 403\u2013415 (2014)","journal-title":"Network Sci."},{"key":"6_CR13","unstructured":"Weisstein, E.W.: (IG) isomorphic graphs. In: MathWorld\u2014A Wolfram Web Resource. \n                    http:\/\/mathworld.wolfram.com\/IsomorphicGraphs.html\n                    \n                  . Accessed 18 Jan 2019"},{"key":"6_CR14","unstructured":"Weisstein, E.W.: (RG) random graph. In: MathWorld\u2014A Wolfram Web Resource. \n                    http:\/\/math-world.wolfram.com\/RandomGraph.html\n                    \n                  . Accessed 18 Jan 2019"},{"key":"6_CR15","unstructured":"Wikipedia (ST) Spanning Tree. \n                    https:\/\/en.wikipedia.org\/wiki\/Spanning_tree\n                    \n                  . Accessed 18 Jan 2019"}],"container-title":["Advances in Intelligent Systems and Computing","Advanced Computing and Systems for Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-13-8962-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T07:06:59Z","timestamp":1565766419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-13-8962-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,15]]},"ISBN":["9789811389610","9789811389627"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-13-8962-7_6","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2019,8,15]]},"assertion":[{"value":"15 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}