{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:08Z","timestamp":1759639028277,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030105631"},{"type":"electronic","value":"9783030105648"}],"license":[{"start":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T00:00:00Z","timestamp":1545350400000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-10564-8_1","type":"book-chapter","created":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T12:40:07Z","timestamp":1545309607000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Graph Profile Realizations and Applications to Social Networks"],"prefix":"10.1007","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[]},{"given":"Keerti","family":"Choudhary","sequence":"additional","affiliation":[]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[]},{"given":"Dror","family":"Rawitz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,21]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0012-365X(94)00104-Q","volume":"136","author":"M Aigner","year":"1994","unstructured":"Aigner, M., Triesch, E.: Realizability and uniqueness in graphs. Discret. Math. 136, 3\u201320 (1994)","journal-title":"Discret. Math."},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-01325-7_1","volume-title":"Realizability of Graph Specifications: Characterizations and Algorithms","author":"A Bar-Noy","year":"2018","unstructured":"Bar-Noy, A., Choudhary, K., Peleg, D., Rawitz, D.: Structural information and communication complexity. In: Lotker, Z., Patt-Shamir, B. (eds.) SIROCCO 2018. LNCS, vol. 11085, pp. 3\u201313. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-01325-7_1"},{"issue":"4","key":"1_CR3","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1080\/15427951.2010.557277","volume":"6","author":"JK Blitzstein","year":"2011","unstructured":"Blitzstein, J.K., Diaconis, P.: A sequential importance sampling algorithm for generating random graphs with prescribed degrees. Internet Math. 6(4), 489\u2013522 (2011)","journal-title":"Internet Math."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.disc.2014.12.011","volume":"338","author":"M Broom","year":"2015","unstructured":"Broom, M., Cannings, C.: Graphic deviation. Discret. Math. 338, 701\u2013711 (2015)","journal-title":"Discret. Math."},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1017\/S0004972700002872","volume":"33","author":"SA Choudum","year":"1991","unstructured":"Choudum, S.A.: A simple proof of the Erd\u00f6s-Gallai theorem on graph sequences. Bull. Aust. Math. Soc. 33(1), 67\u201370 (1991)","journal-title":"Bull. Aust. Math. Soc."},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1080\/15427951.2016.1164768","volume":"12","author":"B Cloteaux","year":"2016","unstructured":"Cloteaux, B.: Fast sequential creation of random realizations of degree sequences. Internet Math. 12(3), 205\u2013219 (2016)","journal-title":"Internet Math."},{"issue":"4603","key":"1_CR7","first-page":"1","volume":"4","author":"Y-H Eom","year":"2014","unstructured":"Eom, Y.-H., Jo, H.-H.: Generalized friendship paradox in complex networks: the case of scientific collaboration. Sci. Rep. 4(4603), 1\u20136 (2014)","journal-title":"Sci. Rep."},{"key":"1_CR8","first-page":"264","volume":"11","author":"P Erd\u00f6s","year":"1960","unstructured":"Erd\u00f6s, P., Gallai, T.: Graphs with prescribed degrees of vertices [Hungarian]. Matematikai Lapok 11, 264\u2013274 (1960)","journal-title":"Matematikai Lapok"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1086\/229693","volume":"96","author":"SL Feld","year":"1991","unstructured":"Feld, S.L.: Why your friends have more friends than you do. Am. J. Sociol. 96, 1464\u20131477 (1991)","journal-title":"Am. J. Sociol."},{"issue":"3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1137\/0110037","volume":"10","author":"SL Hakimi","year":"1962","unstructured":"Hakimi, S.L.: On realizability of a set of integers as degrees of the vertices of a linear graph - I. SIAM J. Appl. Math. 10(3), 496\u2013506 (1962)","journal-title":"SIAM J. Appl. Math."},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"477","DOI":"10.21136\/CPM.1955.108220","volume":"80","author":"V Havel","year":"1955","unstructured":"Havel, V.: A remark on the existence of finite graphs [in Czech]. Casopis Pest. Mat. 80, 477\u2013480 (1955)","journal-title":"Casopis Pest. Mat."},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"961","DOI":"10.2140\/pjm.1957.7.961","volume":"7","author":"PJ Kelly","year":"1957","unstructured":"Kelly, P.J.: A congruence theorem for trees. Pacific J. Math. 7, 961\u2013968 (1957)","journal-title":"Pacific J. Math."},{"key":"1_CR13","unstructured":"Mihail, M., Vishnoi, N.: On generating graphs with prescribed degree sequences for complex network modeling applications. In: 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks (2002)"},{"key":"1_CR14","unstructured":"Mossel, E., Ross, N.: Shotgun assembly of labeled graphs. CoRR, abs\/1504.07682 (2015)"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/00029890.1970.11992413","volume":"77","author":"PV O\u2019Neil","year":"1970","unstructured":"O\u2019Neil, P.V.: Ulam\u2019s conjecture and graph reconstructions. Am. Math. Mon. 77, 35\u201343 (1970)","journal-title":"Am. Math. Mon."},{"issue":"2","key":"1_CR16","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1002\/jgt.3190150209","volume":"15","author":"G Sierksma","year":"1991","unstructured":"Sierksma, G., Hoogeveen, H.: Seven criteria for integer sequences being graphic. J. Graph Theory 15(2), 223\u2013231 (1991)","journal-title":"J. Graph Theory"},{"issue":"18","key":"1_CR17","doi-asserted-by":"publisher","first-page":"3513","DOI":"10.1016\/j.dam.2008.03.033","volume":"156","author":"A Tripathi","year":"2008","unstructured":"Tripathi, A., Tyagi, H.: A simple criterion on degree sequences of graphs. Discret. Appl. Math. 156(18), 3513\u20133517 (2008)","journal-title":"Discret. Appl. Math."},{"key":"1_CR18","volume-title":"A Collection of Mathematical Problems","author":"SM Ulam","year":"1960","unstructured":"Ulam, S.M.: A Collection of Mathematical Problems. Wiley, Hoboken (1960)"},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1002\/net.3230030303","volume":"3","author":"DL Wang","year":"1973","unstructured":"Wang, D.L., Kleitman, D.J.: On the existence of $$n$$-connected graphs with prescribed degrees ($$n>2$$). Networks 3, 225\u2013239 (1973)","journal-title":"Networks"},{"key":"1_CR20","first-page":"239","volume":"267","author":"NC Wormald","year":"1999","unstructured":"Wormald, N.C.: Models of random regular graphs. Surv. Comb. 267, 239\u2013298 (1999)","journal-title":"Surv. Comb."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10564-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:50:09Z","timestamp":1709823009000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10564-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,21]]},"ISBN":["9783030105631","9783030105648"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10564-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,21]]},"assertion":[{"value":"21 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guwahati","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 February 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iitg.ac.in\/walcom2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"100","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.8","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}