{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:30:05Z","timestamp":1758267005710},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1109\/infocom.2015.7218534","type":"proceedings-article","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T21:33:36Z","timestamp":1440452016000},"source":"Crossref","is-referenced-by-count":14,"title":["Construction of simple graphs with a target joint degree matrix and beyond"],"prefix":"10.1109","author":[{"given":"Minas","family":"Gjoka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Balint","family":"Tillman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Athina","family":"Markopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.65.026107"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v024.i03"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159930"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298311"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240060204"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.103.058701"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2567993"},{"key":"ref17","article-title":"Tuning clustering in random networks with arbitrary degree distributions","author":"serrano","year":"2005","journal-title":"Physical Review E"},{"key":"ref18","article-title":"Constructing and sampling graphs with a prescribed joint degree distribution using markov chains","author":"stanton","year":"2011","journal-title":"JEA"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.1470768"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-10-405"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335326"},{"key":"ref6","article-title":"Networkx","author":"developers","year":"2010","journal-title":"networkx lanl gov"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0010012"},{"key":"ref8","article-title":"Networks with desired correlations","author":"dorogovtsev","year":"0","journal-title":"arXiv 0308336 ‘03"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1596519.1596522"},{"key":"ref2","year":"0","journal-title":"SNAP Graph Library"},{"key":"ref1","year":"0","journal-title":"Simple Graph"},{"key":"ref9","article-title":"2.5 K-Graphs: from Sampling to Generation","author":"gjoka","year":"2013","journal-title":"Proc of IEEE INFOCOM"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1592665.1592675"},{"key":"ref21","article-title":"Graphic realizations of joint-degree matrices","author":"amanatidis","year":"2008","journal-title":"Unpublished manuscript"}],"event":{"name":"IEEE INFOCOM 2015 - IEEE Conference on Computer Communications","location":"Kowloon, Hong Kong","start":{"date-parts":[[2015,4,26]]},"end":{"date-parts":[[2015,5,1]]}},"container-title":["2015 IEEE Conference on Computer Communications (INFOCOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7172813\/7218353\/07218534.pdf?arnumber=7218534","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,25]],"date-time":"2017-03-25T06:19:58Z","timestamp":1490422798000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7218534\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/infocom.2015.7218534","relation":{},"subject":[],"published":{"date-parts":[[2015,4]]}}}