{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:37:28Z","timestamp":1729629448729,"version":"3.28.0"},"reference-count":18,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.1109\/wsc.2011.6148029","type":"proceedings-article","created":{"date-parts":[[2012,2,9]],"date-time":"2012-02-09T22:20:26Z","timestamp":1328826026000},"page":"3330-3338","source":"Crossref","is-referenced-by-count":0,"title":["Extracting hierarchies with overlapping structure from network data"],"prefix":"10.1109","author":[{"given":"Brian","family":"Cloteaux","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2007.04.006"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536474"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.74.036104"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181881"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0703740104"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"440d","DOI":"10.1093\/nar\/gkm883","article-title":"The Gene Ontology project in 2008","volume":"36","year":"2008","journal-title":"Nucleic Acids Research"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of ‘small-world’ networks","volume":"393","author":"watts","year":"1998","journal-title":"Nature"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557128"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2010.5678990"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/nature06830"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.03.007"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/777412.777419","article-title":"A polynomial-time tree decomposition to minimize congestion","author":"harrelson","year":"2003","journal-title":"Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2006.04.047"},{"key":"ref2","first-page":"24","article-title":"A practical algorithm for constructing oblivious routing schemes","author":"bienkowski","year":"0","journal-title":"Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/990308.990313"},{"key":"ref1","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"}],"event":{"name":"2011 Winter Simulation Conference - (WSC 2011)","start":{"date-parts":[[2011,12,11]]},"location":"Phoenix, AZ, USA","end":{"date-parts":[[2011,12,14]]}},"container-title":["Proceedings of the 2011 Winter Simulation Conference (WSC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6135535\/6147014\/06148029.pdf?arnumber=6148029","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T12:05:23Z","timestamp":1561291523000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6148029\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/wsc.2011.6148029","relation":{},"subject":[],"published":{"date-parts":[[2011,12]]}}}