{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:48:02Z","timestamp":1729673282928,"version":"3.28.0"},"reference-count":44,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1109\/bigdata.2017.8258316","type":"proceedings-article","created":{"date-parts":[[2018,1,15]],"date-time":"2018-01-15T17:47:28Z","timestamp":1516038448000},"page":"3312-3321","source":"Crossref","is-referenced-by-count":5,"title":["A parallel algorithm for generating a random graph with a prescribed degree sequence"],"prefix":"10.1109","author":[{"given":"Hasanuzzaman","family":"Bhuiyan","sequence":"first","affiliation":[]},{"given":"Maleq","family":"Khan","sequence":"additional","affiliation":[]},{"given":"Madhav","family":"Marathe","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.98.2.404"},{"journal-title":"JUNG","article-title":"Java universal network\/graph framework","year":"0","key":"ref38"},{"key":"ref33","first-page":"264","article-title":"Gráfok el?ìrt fokù pontokkal (Graphs with points of prescribed degrees, in Hungarian)","volume":"11","author":"erd?s","year":"1961","journal-title":"Mat Lapok"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-015-0389-y"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58338-6_78"},{"journal-title":"A Survey of Parallel Algorithms for Shared-Memory Machines","year":"1988","author":"karp","key":"ref30"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/eScience.2012.6404422"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2897350.2897355"},{"key":"ref35","article-title":"Erd?s-Gallai test in linear time","author":"iv\u00e1nyi","year":"2011","journal-title":"COMBINATORICA"},{"key":"ref34","volume":"56","author":"mahadev","year":"1995","journal-title":"Threshold Graphs and Related Topics"},{"key":"ref10","volume":"367","author":"lov\u00e1sz","year":"2009","journal-title":"Matching Theory"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2016.12.005"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0070380"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2005.10.009"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2016.1164768"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2010.557277"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9340-1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0010012"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1038\/35082140"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.5"},{"key":"ref19","first-page":"16","article-title":"The Markov chain simulation method for generating connected power law random graphs","volume":"111","author":"gkantsidist","year":"2003","journal-title":"Proc 5th Workshop Algorithm Eng"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.2307\/2669847"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.015103"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/0110037"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"barab\u00e1si","year":"1999","journal-title":"Science"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480194267932"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4_7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.252631999"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.122653799"},{"journal-title":"Graphs and Hypergraphs","year":"1973","author":"berge","key":"ref9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.815300"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2014.15"},{"key":"ref22","first-page":"980","article-title":"Sampling regular graphs and a peer-to-peer network","author":"cooper","year":"2005","journal-title":"Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"journal-title":"Parallel Algorithms for Switching Edges and Generating Random Graphs from Given Degree Sequences using HPC Platforms","year":"2017","author":"bhuiyan","key":"ref21"},{"key":"ref42","article-title":"Teaching parallel computing through parallel prefix","author":"aluru","year":"2012","journal-title":"Conference on High Performance Computing Networking Storage and Analysis"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721335.010"},{"key":"ref41","first-page":"7","article-title":"Parallel Erdos-Gallai algorithm","author":"iv\u00e1nyi","year":"2011","journal-title":"Central European Journal of Operations Research"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/S003614450342480"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2009.5429425"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2003.10.007"},{"journal-title":"SNAP Datasets Stanford large network dataset collection","year":"0","author":"leskovec","key":"ref43"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548399003867"}],"event":{"name":"2017 IEEE International Conference on Big Data (Big Data)","start":{"date-parts":[[2017,12,11]]},"location":"Boston, MA","end":{"date-parts":[[2017,12,14]]}},"container-title":["2017 IEEE International Conference on Big Data (Big Data)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8241556\/8257893\/08258316.pdf?arnumber=8258316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,9]],"date-time":"2019-10-09T07:06:08Z","timestamp":1570604768000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8258316\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2017.8258316","relation":{},"subject":[],"published":{"date-parts":[[2017,12]]}}}