Abstract
In this paper, we study the problem of ecologically coloring a graph. Intuitively, an ecological coloring of a graph is a role assignment to the nodes of the graph, such that two nodes surrounded by the same set of roles must be assigned the same role (Borgatti and Everett, 1992). We prove that, for any simple undirected graph G with n G distinct neighborhoods and for any integer k with 1 ≤ k ≤ n G , G admits an ecological coloring which uses exactly k roles, and that this coloring can be computed in polynomial time. Our result strongly contrasts with the NP-completeness result of the regular coloring problem, where it is required that two nodes with the same role must be surrounded by the same set of roles (Fiala and Paulusma, 2005). Hence, we conclude that not only the ecological coloring is easier to understand as a model of social relationships (Borgatti and Everett, 1994), but it is also feasible from a computational complexity point of view.
This work was partially supported by the EU under the EU/IST Project 15964 AEOLUS.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Borgatti, S.P., Everett, M.G.: The class of regular equivalences: algebraic structure and computation. Social Networks 11, 65–88 (1989)
Borgatti, S.P., Everett, M.G.: Graph colorings and power in experimental exchange networks. Social Networks 14, 287–308 (1992)
Borgatti, S.P., Everett, M.G.: Ecological and perfect colorings. Social Networks 16, 43–55 (1994)
Brandes, U., Erlebach, T. (eds.): Network Analysis. LNCS, vol. 3418. Springer, Heidelberg (2005)
Breiger, R.L.: The Analysis of Social Networks. In: Hardy, M.A., Bryman, A. (eds.) Handbook of Data Analysis, pp. 505–526. Sage Publications, London (2004)
Charon, I., Honkala, I., Hudry, O., Lobstein, A.: Structural Properties of Twin-Free Graphs. The Electronic Journal of Combinatorics 14 (2007)
Fiala, J., Paulusma, D.: A complete complexity classification of the role assignment problem. Theoretical Computer Science 349, 67–81 (2005)
Kotlov, A., Lovász, L.: The rank and size of graphs. Journal of Graph Theory 23, 185–189 (1996)
Lerner, J.: Role assignments. In: ch. 9 [4]
Lorrain, F., White, H.C.: Structural equivalence of individuals in social networks. Journal of Mathematical Sociology 1, 49–80 (1971)
Roberts, F.S., Sheng, L.: How hard is to determine if a graph has a 2-role assignment? Networks 37(2), 67–73 (2001)
White, D.R., Reitz, K.P.: Graph and semigroup homomorphisms on networks of relations. Social Networks 5, 193–234 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Crescenzi, P., Di Ianni, M., Greco, F., Rossi, G., Vocca, P. (2008). Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds) Graph-Theoretic Concepts in Computer Science. WG 2008. Lecture Notes in Computer Science, vol 5344. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92248-3_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-92248-3_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92247-6
Online ISBN: 978-3-540-92248-3
eBook Packages: Computer ScienceComputer Science (R0)