{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:46:34Z","timestamp":1725471994761},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540347712"},{"type":"electronic","value":"9783540347743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/3-540-34774-7_30","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T19:48:26Z","timestamp":1156535306000},"page":"231-237","source":"Crossref","is-referenced-by-count":4,"title":["Social Leaders in Graphs"],"prefix":"10.1007","author":[{"given":"V.","family":"Blondel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"de Kerchove","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Huens","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Van Dooren","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M.E.J. Newman","year":"2003","unstructured":"Newman MEJ (2003) The structure and function of complex networks. SIAM Review 45, 167\u2013256","journal-title":"SIAM Review"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T. Kamada","year":"1989","unstructured":"Kamada T and Kawai S (1989) An Algorithm for Drawing General Undirected Graphs. Information Processing Letters 31, 7\u201315","journal-title":"Information Processing Letters"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Harel D, and Koren Y (2000) A fast multi-scale method for drawing large graphs. In Proc. 5th Working Conference on Advanced Visual Interfaces (AVI\u201900), A. Press, Ed., pp. 282\u2013285. Appl Polym Sci 64:1079\u20131090","DOI":"10.1145\/345513.345353"},{"key":"30_CR4","first-page":"3541","volume":"40","author":"L.C. Freeman","year":"1977","unstructured":"Freeman LC (1977) A set of measures of centrality based upon betweenness. So-ciometry 40, 3541.","journal-title":"So-ciometry"},{"key":"30_CR5","first-page":"215239","volume":"1","author":"L.C. Freeman","year":"1979","unstructured":"Freeman LC (1979) Centrality in social networks: Conceptual clarification. Social Networks 1, 215239.","journal-title":"Social Networks"},{"key":"30_CR6","volume-title":"Who is the best connected scientist? A study of scientific coauthorship networks","author":"M.E.J. Newman","year":"2001","unstructured":"Newman MEJ, Ben-Naim E, Frauenfelder H, and Toroczkai Z (2001) Who is the best connected scientist? A study of scientific coauthorship networks. To appear in Complex Networks, Springer, Berlin. 215239."},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"066111","DOI":"10.1103\/PhysRevE.70.066111","volume":"70","author":"A. Clauset","year":"2004","unstructured":"Clauset A, Newman MEJ, and Moore C (2004) Finding community structure in very large networks. Phys. Rev. E 70, 066111","journal-title":"Phys. Rev. E"}],"container-title":["Lecture Notes in Control and Information Sciences","Positive Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-34774-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,12]],"date-time":"2019-02-12T02:43:37Z","timestamp":1549939417000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-34774-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540347712","9783540347743"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-34774-7_30","relation":{},"ISSN":["0170-8643"],"issn-type":[{"type":"print","value":"0170-8643"}],"subject":[],"published":{"date-parts":[[2006]]}}}