{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:21:27Z","timestamp":1725618087744},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642247033"},{"type":"electronic","value":"9783642247040"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24704-0_30","type":"book-chapter","created":{"date-parts":[[2011,10,6]],"date-time":"2011-10-06T05:11:06Z","timestamp":1317877866000},"page":"283-286","source":"Crossref","is-referenced-by-count":6,"title":["Modelling Social Network Evolution"],"prefix":"10.1007","author":[{"given":"Rados\u0142aw","family":"Michalski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Palus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piotr","family":"Br\u00f3dka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Przemys\u0142aw","family":"Kazienko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Juszczyszyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"30_CR1","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/S0167-8655(97)00060-3","volume":"18","author":"H. Bunke","year":"1997","unstructured":"Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters\u00a018(8), 689\u2013694 (1997)","journal-title":"Pattern Recognition Letters"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1002\/(SICI)1097-0118(199810)29:2<73::AID-JGT3>3.0.CO;2-9","volume":"29","author":"L. Eroh","year":"1998","unstructured":"Eroh, L., Schultz, M.: Matching graphs. Journal of Graph Theory\u00a029(2), 73\u201386 (1998)","journal-title":"Journal of Graph Theory"},{"key":"30_CR3","first-page":"407","volume-title":"SocialCom 2010","author":"P. Kazienko","year":"2010","unstructured":"Kazienko, P., Br\u00f3dka, P., Musia\u0142, K., Gaworecki, J.: Multi-layered Social Network Creation Based on Bibliographic Data. In: SocialCom 2010, pp. 407\u2013412. IEEE Computer Society Press, Los Alamitos (2010)"},{"key":"30_CR4","first-page":"5","volume-title":"WI-IAT 2010","author":"P. Kazienko","year":"2010","unstructured":"Kazienko, P., Br\u00f3dka, P., Musia\u0142, K.: Individual Neighbourhood Exploration in Complex Multi-layered Social Network. In: WI-IAT 2010, pp. 5\u20138. IEEE Computer Society Press, Los Alamitos (2010)"},{"key":"30_CR5","unstructured":"Zager, L.: Graph Similarity and Matching. MIT Thesis, USA (2005)"}],"container-title":["Lecture Notes in Computer Science","Social Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24704-0_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T03:42:34Z","timestamp":1554867754000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24704-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642247033","9783642247040"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24704-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}