{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:41:43Z","timestamp":1725522103934},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540922476"},{"type":"electronic","value":"9783540922483"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92248-3_9","type":"book-chapter","created":{"date-parts":[[2008,12,4]],"date-time":"2008-12-04T13:36:17Z","timestamp":1228397777000},"page":"90-100","source":"Crossref","is-referenced-by-count":2,"title":["Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings"],"prefix":"10.1007","author":[{"given":"Pilu","family":"Crescenzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miriam","family":"Di Ianni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Greco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluca","family":"Rossi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paola","family":"Vocca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Borgatti, S.P., Everett, M.G.: The class of regular equivalences: algebraic structure and computation. Social Networks\u00a011, 65\u201388 (1989)","DOI":"10.1016\/0378-8733(89)90018-X"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Borgatti, S.P., Everett, M.G.: Graph colorings and power in experimental exchange networks. Social Networks\u00a014, 287\u2013308 (1992)","DOI":"10.1016\/0378-8733(92)90006-S"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Borgatti, S.P., Everett, M.G.: Ecological and perfect colorings. Social Networks\u00a016, 43\u201355 (1994)","DOI":"10.1016\/0378-8733(94)90010-8"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Brandes, U., Erlebach, T. (eds.): Network Analysis. LNCS, vol.\u00a03418. Springer, Heidelberg (2005)","DOI":"10.1007\/b106453"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Breiger, R.L.: The Analysis of Social Networks. In: Hardy, M.A., Bryman, A. (eds.) Handbook of Data Analysis, pp. 505\u2013526. Sage Publications, London (2004)","DOI":"10.4135\/9781848608184.n22"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Charon, I., Honkala, I., Hudry, O., Lobstein, A.: Structural Properties of Twin-Free Graphs. The Electronic Journal of Combinatorics\u00a014 (2007)","DOI":"10.37236\/934"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Fiala, J., Paulusma, D.: A complete complexity classification of the role assignment problem. Theoretical Computer Science\u00a0349, 67\u201381 (2005)","DOI":"10.1016\/j.tcs.2005.09.029"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Kotlov, A., Lov\u00e1sz, L.: The rank and size of graphs. Journal of Graph Theory\u00a023, 185\u2013189 (1996)","DOI":"10.1002\/(SICI)1097-0118(199610)23:2<185::AID-JGT9>3.3.CO;2-X"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Lerner, J.: Role assignments. In: ch. 9 [4]","DOI":"10.1007\/978-3-540-31955-9_9"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Lorrain, F., White, H.C.: Structural equivalence of individuals in social networks. Journal of Mathematical Sociology\u00a01, 49\u201380 (1971)","DOI":"10.1080\/0022250X.1971.9989788"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Roberts, F.S., Sheng, L.: How hard is to determine if a graph has a 2-role assignment? Networks\u00a037(2), 67\u201373 (2001)","DOI":"10.1002\/1097-0037(200103)37:2<67::AID-NET1>3.0.CO;2-9"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"White, D.R., Reitz, K.P.: Graph and semigroup homomorphisms on networks of relations. Social Networks\u00a05, 193\u2013234 (1983)","DOI":"10.1016\/0378-8733(83)90025-4"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92248-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,12]],"date-time":"2020-05-12T20:38:38Z","timestamp":1589315918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92248-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540922476","9783540922483"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92248-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}